@itwin/ecschema-rpcinterface-tests 4.4.0-dev.21 → 4.4.0-dev.24

package/lib/dist/bundled-tests.js

@@ -21,10 +21,10 @@
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.17/node_modules/@itwin/certa/lib/utils/CallbackUtils.js":
-/*!*********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.17/node_modules/@itwin/certa/lib/utils/CallbackUtils.js ***!
-  \*********************************************************************************************************************/
+/***/ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.8.0/node_modules/@itwin/certa/lib/utils/CallbackUtils.js":
+/*!********************************************************************************************************************!*\
+  !*** ../../common/temp/node_modules/.pnpm/@itwin+certa@3.8.0/node_modules/@itwin/certa/lib/utils/CallbackUtils.js ***!
+  \********************************************************************************************************************/
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 
 "use strict";
@@ -3183,7 +3183,7 @@ exports.getAccessTokenFromBackend = exports.getTokenCallbackName = void 0;
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
-const CallbackUtils_1 = __webpack_require__(/*! @itwin/certa/lib/utils/CallbackUtils */ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.17/node_modules/@itwin/certa/lib/utils/CallbackUtils.js");
+const CallbackUtils_1 = __webpack_require__(/*! @itwin/certa/lib/utils/CallbackUtils */ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.8.0/node_modules/@itwin/certa/lib/utils/CallbackUtils.js");
 // Shared by both the frontend and backend side of the tests
 exports.getTokenCallbackName = "getToken";
 async function getAccessTokenFromBackend(user, oidcConfig) {
@@ -19281,8 +19281,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (__WEBPACK_DEFAULT_EXPORT__)
 /* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/createClass.js");
 
 
 
@@ -27598,6 +27598,7 @@ __webpack_require__.r(__webpack_exports__);
 /**
  * Mirrors the SpanKind enum from [@opentelemetry/api](https://open-telemetry.github.io/opentelemetry-js/enums/_opentelemetry_api.SpanKind.html)
  * @public
+ * @deprecated in 4.4 - OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.
  */
 var SpanKind;
 (function (SpanKind) {
@@ -27653,9 +27654,11 @@ function* getFlatEntries(obj, path = "") {
 function flattenObject(obj) {
     return Object.fromEntries(getFlatEntries(obj));
 }
+/* eslint-disable deprecation/deprecation -- lots of self-references here... */
 /**
  * Enables OpenTelemetry tracing in addition to traditional logging.
  * @public
+ * @deprecated in 4.4 - OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.
  */
 class Tracing {
     /**
@@ -27687,6 +27690,14 @@ class Tracing {
             }
         });
     }
+    /**
+     * Adds a span event describing a runtime exception, as advised in OpenTelemetry documentation
+     * @param e error (exception) object
+     * @internal
+     */
+    static recordException(e) {
+        Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.recordException(e);
+    }
     /**
      * Enable logging to OpenTelemetry. [[Tracing.withSpan]] will be enabled, all log entries will be attached to active span as span events.
      * [IModelHost.startup]($backend) will call this automatically if the `enableOpenTelemetry` option is enabled and it succeeds in requiring `@opentelemetry/api`.
@@ -27736,6 +27747,7 @@ class Tracing {
         Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttributes(attributes);
     }
 }
+/* eslint-enable deprecation/deprecation */
 
 
 /***/ }),
@@ -35093,6 +35105,11 @@ class PackedFeatureTable {
         result.modelId.upper = this.batchModelIdPair.upper;
         return result;
     }
+    getModelIdPair(_featureIndex, out) {
+        out.lower = this.batchModelIdPair.lower;
+        out.upper = this.batchModelIdPair.upper;
+        return out;
+    }
     /** Returns the element ID of the Feature associated with the specified index, or undefined if the index is out of range. */
     findElementId(featureIndex) {
         if (featureIndex >= this.numFeatures)
@@ -35246,6 +35263,10 @@ class MultiModelPackedFeatureTable {
     getElementIdPair(featureIndex, out) {
         return this._features.getElementIdPair(featureIndex, out);
     }
+    getModelIdPair(featureIndex, out) {
+        this._models.getModelIdPair(featureIndex, out);
+        return out;
+    }
     findElementId(featureIndex) {
         return this._features.findElementId(featureIndex);
     }
@@ -39228,6 +39249,12 @@ class PlanProjectionSettings {
             props.enforceDisplayPriority = changedProps.enforceDisplayPriority;
         return new PlanProjectionSettings(props);
     }
+    /** Return true if these settings are equivalent to the specified settings. */
+    equals(other) {
+        if (this === other)
+            return true;
+        return this.elevation === other.elevation && this.transparency === other.transparency && this.overlay === other.overlay && this.enforceDisplayPriority === other.enforceDisplayPriority;
+    }
 }
 
 
@@ -56186,7 +56213,7 @@ class RpcInvocation {
                 // this catch block is intentionally placed inside `runActivity` to attach the right logging metadata and use the correct openTelemetry span.
                 if (!(error instanceof _RpcControl__WEBPACK_IMPORTED_MODULE_6__.RpcPendingResponse)) {
                     _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Logger.logError(_CommonLoggerCategory__WEBPACK_IMPORTED_MODULE_1__.CommonLoggerCategory.RpcInterfaceBackend, "Error in RPC operation", { error: _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.BentleyError.getErrorProps(error) });
-                    _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Tracing.setAttributes({ error: true });
+                    _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Tracing.recordException(error);
                 }
                 throw error;
             }));
@@ -92839,6 +92866,7 @@ class Viewport {
     invalidateScene() {
         this._sceneValid = false;
         this._timePointValid = false;
+        this.onSceneInvalidated.raiseEvent(this);
         this.invalidateDecorations();
     }
     /** Mark the viewport's "render plan" as having changed, so that the next call to [[renderFrame]] will recreate it.
@@ -93459,6 +93487,11 @@ class Viewport {
        * @beta
        */
         this.onMapLayerScaleRangeVisibilityChanged = new _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
+        /** Event invoked every time [[invalidateScene]] is called.
+         * @note This event will be raised **very** frequently. Avoid doing significant work inside of your event listener.
+         * @beta
+         */
+        this.onSceneInvalidated = new _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
         /** @internal */
         this._hasMissingTiles = false;
         /** A function executed by `setView()` when `this._view` changes. */
@@ -97290,9 +97323,17 @@ function collectTransferables(document) {
                 break;
         }
     };
-    for (const node of document.nodes)
-        for (const primitive of node.primitives)
-            addPrimitive(primitive);
+    for (const node of document.nodes) {
+        if (undefined !== node.groupId) {
+            for (const primNode of node.nodes)
+                for (const primitive of primNode.primitives)
+                    addPrimitive(primitive);
+        }
+        else {
+            for (const primitive of node.primitives)
+                addPrimitive(primitive);
+        }
+    }
     for (const primitives of document.patterns.values())
         for (const primitive of primitives)
             addPrimitive(primitive);
@@ -97579,7 +97620,8 @@ class Parser {
             y: this._document.rtcCenter[1] ?? 0,
             z: this._document.rtcCenter[2] ?? 0,
         } : undefined;
-        const nodes = this.parseNodes(featureTable);
+        const primitiveNodes = this.parseNodes(featureTable);
+        const nodes = this.groupPrimitiveNodes(primitiveNodes, featureTable);
         return {
             featureTable,
             nodes,
@@ -97698,8 +97740,12 @@ class Parser {
         const docPrimitives = docMesh.primitives;
         if (!docPrimitives)
             return;
+        const primitives = docPrimitives.map((x) => this.parseNodePrimitive(x)).filter((x) => x !== undefined);
+        if (primitives.length === 0)
+            return;
         const nodesById = new Map();
         const getNode = (nodeId) => {
+            nodeId = nodeId ?? _render_AnimationNodeId__WEBPACK_IMPORTED_MODULE_8__.AnimationNodeId.Untransformed;
             let node = nodesById.get(nodeId);
             if (!node) {
                 node = {
@@ -97722,6 +97768,9 @@ class Parser {
             const nodeId = featureTable.getAnimationNodeId(featureIndex);
             return 0 !== nodeId && discreteNodeIds.has(nodeId) ? nodeId : 0;
         };
+        this.splitPrimitives(primitives, featureTable, computeNodeId, getNode);
+    }
+    splitPrimitives(primitives, featureTable, computeNodeId, getPrimitivesNode) {
         const splitArgs = {
             maxDimension: this._options.maxVertexTableSize,
             computeNodeId,
@@ -97735,15 +97784,13 @@ class Parser {
             const material = (typeof imdl.material === "string") ? this.materialFromJson(imdl.material) : Material.create(toMaterialParams(imdl.material));
             return material ? { isAtlas: false, material } : undefined;
         };
-        for (const docPrimitive of docPrimitives) {
-            const primitive = this.parseNodePrimitive(docPrimitive);
-            if (!primitive)
-                continue;
+        for (const primitive of primitives) {
             switch (primitive.type) {
-                case "pattern":
-                    // ###TODO animated area patterns
-                    getNode(_render_AnimationNodeId__WEBPACK_IMPORTED_MODULE_8__.AnimationNodeId.Untransformed).primitives.push(primitive);
+                case "pattern": {
+                    // ###TODO splitting area patterns
+                    getPrimitivesNode(undefined).primitives.push(primitive);
                     break;
+                }
                 case "mesh": {
                     const mesh = primitive.params;
                     const texMap = mesh.surface.textureMapping;
@@ -97780,8 +97827,9 @@ class Parser {
                             }
                         }
                         (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(p.surface.textureMapping === undefined || p.surface.textureMapping.texture instanceof Texture);
-                        getNode(nodeId).primitives.push({
+                        getPrimitivesNode(nodeId).primitives.push({
                             type: "mesh",
+                            modifier: primitive.modifier,
                             params: {
                                 vertices: fromVertexTable(p.vertices),
                                 surface: {
@@ -97809,8 +97857,9 @@ class Parser {
                     };
                     const split = (0,_render_primitives_VertexTableSplitter__WEBPACK_IMPORTED_MODULE_7__.splitPointStringParams)({ ...splitArgs, params });
                     for (const [nodeId, p] of split) {
-                        getNode(nodeId).primitives.push({
+                        getPrimitivesNode(nodeId).primitives.push({
                             type: "point",
+                            modifier: primitive.modifier,
                             params: {
                                 vertices: fromVertexTable(p.vertices),
                                 indices: p.indices.data,
@@ -97832,8 +97881,9 @@ class Parser {
                     };
                     const split = (0,_render_primitives_VertexTableSplitter__WEBPACK_IMPORTED_MODULE_7__.splitPolylineParams)({ ...splitArgs, params });
                     for (const [nodeId, p] of split) {
-                        getNode(nodeId).primitives.push({
+                        getPrimitivesNode(nodeId).primitives.push({
                             type: "polyline",
+                            modifier: primitive.modifier,
                             params: {
                                 ...p,
                                 vertices: fromVertexTable(p.vertices),
@@ -97850,6 +97900,52 @@ class Parser {
             }
         }
     }
+    groupPrimitiveNodes(inputNodes, imdlFeatureTable) {
+        const modelGroups = this._options.modelGroups;
+        if (!modelGroups?.length)
+            return inputNodes;
+        const groupNodes = [];
+        let orphanNode;
+        const getGroupNode = (groupId) => {
+            (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(groupId <= modelGroups.length);
+            if (groupId === modelGroups.length) {
+                // This would happen if:
+                //  - The tile contains geometry from a model not present in modelGroups (should never occur); or
+                //  - The tile contains an area pattern (we haven't yet implemented splitting for them).
+                // In either case, orphaned geometry will end up getting discarded.
+                return orphanNode ?? (orphanNode = { groupId, nodes: [] });
+            }
+            let groupNode = groupNodes[groupId];
+            if (!groupNode)
+                groupNodes[groupId] = groupNode = { groupId, nodes: [] };
+            return groupNode;
+        };
+        const featureTable = convertFeatureTable(imdlFeatureTable, this._options.batchModelId);
+        const modelIdPair = { lower: 0, upper: 0 };
+        const computeNodeId = (featureIndex) => {
+            featureTable.getModelIdPair(featureIndex, modelIdPair);
+            const modelId = _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Id64.fromUint32PairObject(modelIdPair);
+            for (let i = 0; i < modelGroups.length; i++) {
+                if (modelGroups[i].has(modelId))
+                    return i;
+            }
+            return modelGroups.length;
+        };
+        for (const inputNode of inputNodes) {
+            // Indexed by model group index.
+            const splitNodes = [];
+            const getSplitNode = (groupIndex) => {
+                groupIndex = groupIndex ?? modelGroups.length;
+                if (!splitNodes[groupIndex]) {
+                    const splitNode = splitNodes[groupIndex] = { ...inputNode, primitives: [] };
+                    getGroupNode(groupIndex).nodes.push(splitNode);
+                }
+                return splitNodes[groupIndex];
+            };
+            this.splitPrimitives(inputNode.primitives, featureTable, computeNodeId, getSplitNode);
+        }
+        return groupNodes.filter((x) => undefined !== x);
+    }
     parseTesselatedPolyline(json) {
         const indices = this.findBuffer(json.indices);
         const prevIndices = this.findBuffer(json.prevIndices);
@@ -110554,6 +110650,7 @@ class BranchState {
     get secondaryClassifiers() { return this._opts.secondaryClassifiers; }
     get realityModelDisplaySettings() { return this._opts.realityModelDisplaySettings; }
     get viewAttachmentId() { return this._opts.viewAttachmentId; }
+    get groupNodeId() { return this._opts.groupNodeId; }
     get symbologyOverrides() {
         return this._opts.symbologyOverrides;
     }
@@ -110584,6 +110681,7 @@ class BranchState {
             appearanceProvider: branch.appearanceProvider ?? (branch.branch.symbologyOverrides ? undefined : prev.appearanceProvider),
             realityModelDisplaySettings: branch.branch.realityModelDisplaySettings ?? prev.realityModelDisplaySettings,
             viewAttachmentId: branch.viewAttachmentId ?? prev.viewAttachmentId,
+            groupNodeId: branch.branch.groupNodeId ?? prev.groupNodeId,
         });
     }
     getFeatureAppearance(overrides, elemLo, elemHi, subcatLo, subcatHi, geomClass, modelLo, modelHi, type, animationNodeId) {
@@ -115004,6 +115102,9 @@ class Branch extends Graphic {
         this.branch.collectStatistics(stats);
     }
     shouldAddCommands(commands) {
+        const group = commands.target.currentBranch.groupNodeId;
+        if (undefined !== group && undefined !== this.branch.groupNodeId && this.branch.groupNodeId !== group)
+            return false;
         const nodeId = commands.target.getAnimationTransformNodeId(this.branch.animationNodeId);
         return undefined === nodeId || nodeId === commands.target.currentAnimationTransformNodeId;
     }
@@ -141730,12 +141831,39 @@ function createPatternGraphic(params, options) {
     return branch.isEmpty ? undefined : options.system.createGraphicBranch(branch, _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_1__.Transform.createIdentity(), { clipVolume });
 }
 function createNodeGraphics(node, options) {
+    if (undefined === node.groupId)
+        return createPrimitivesNodeGraphics(node, options);
     const graphics = [];
+    for (const child of node.nodes) {
+        graphics.push(...createPrimitivesNodeGraphics(child, options));
+    }
+    if (graphics.length === 0)
+        return graphics;
+    const branch = new _render_GraphicBranch__WEBPACK_IMPORTED_MODULE_7__.GraphicBranch(true);
+    branch.groupNodeId = node.groupId;
+    branch.entries.push(...graphics);
+    return [options.system.createBranch(branch, _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_1__.Transform.createIdentity())];
+}
+function createPrimitivesNodeGraphics(node, options) {
+    let graphics = [];
     for (const primitive of node.primitives) {
         const graphic = primitive.type === "pattern" ? createPatternGraphic(primitive.params, options) : createPrimitiveGraphic(primitive, options);
         if (graphic)
             graphics.push(graphic);
     }
+    if (!graphics.length)
+        return graphics;
+    if (undefined !== node.layerId) {
+        const layerGraphic = 1 === graphics.length ? graphics[0] : options.system.createGraphicList(graphics);
+        graphics = [options.system.createGraphicLayer(layerGraphic, node.layerId)];
+    }
+    else if (undefined !== node.animationNodeId) {
+        const branch = new _render_GraphicBranch__WEBPACK_IMPORTED_MODULE_7__.GraphicBranch(true);
+        branch.animationId = node.animationId;
+        branch.animationNodeId = node.animationNodeId;
+        branch.entries.push(...graphics);
+        graphics = [options.system.createBranch(branch, _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_1__.Transform.createIdentity())];
+    }
     return graphics;
 }
 /** @internal */
@@ -141750,23 +141878,7 @@ async function decodeImdlGraphics(options) {
     const system = options.system;
     const graphics = [];
     for (const node of options.document.nodes) {
-        const nodeGraphics = createNodeGraphics(node, graphicsOptions);
-        if (nodeGraphics.length === 0)
-            continue;
-        if (undefined !== node.layerId) {
-            const layerGraphic = 1 === nodeGraphics.length ? nodeGraphics[0] : system.createGraphicList(nodeGraphics);
-            graphics.push(system.createGraphicLayer(layerGraphic, node.layerId));
-        }
-        else if (undefined !== node.animationNodeId) {
-            const branch = new _render_GraphicBranch__WEBPACK_IMPORTED_MODULE_7__.GraphicBranch(true);
-            branch.animationId = node.animationId;
-            branch.animationNodeId = node.animationNodeId;
-            branch.entries.push(...nodeGraphics);
-            graphics.push(system.createBranch(branch, _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_1__.Transform.createIdentity()));
-        }
-        else {
-            graphics.push(...nodeGraphics);
-        }
+        graphics.push(...createNodeGraphics(node, graphicsOptions));
     }
     switch (graphics.length) {
         case 0: return undefined;
@@ -141945,6 +142057,7 @@ async function readImdlContent(args) {
         maxVertexTableSize: _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.renderSystem.maxTextureSize,
         omitEdges: false === args.loadEdges,
         createUntransformedRootNode: args.containsTransformNodes,
+        modelGroups: args.modelGroups,
     };
     const document = args.parseDocument ? (await args.parseDocument(parseOpts)) : (0,_common_imdl_ParseImdlDocument__WEBPACK_IMPORTED_MODULE_5__.parseImdlDocument)({ ...parseOpts, timeline: args.timeline });
     if (isCanceled())
@@ -147403,6 +147516,7 @@ class TileDrawArgs {
         this._appearanceProvider = params.appearanceProvider;
         this.hiddenLineSettings = params.hiddenLineSettings;
         this.animationTransformNodeId = params.animationTransformNodeId;
+        this.groupNodeId = params.groupNodeId;
         this.boundingRange = params.boundingRange;
         this.maximumScreenSpaceError = params.maximumScreenSpaceError ?? 16; // 16 is Cesium's default.
         // Do not cull tiles based on clip volume if tiles outside clip are supposed to be drawn but in a different color.
@@ -147481,6 +147595,12 @@ class TileDrawArgs {
         let graphic = this.context.createGraphicBranch(graphics, this.location, opts);
         if (undefined !== this.animationTransformNodeId)
             graphic = this.context.renderSystem.createAnimationTransformNode(graphic, this.animationTransformNodeId);
+        if (undefined !== this.groupNodeId) {
+            const branch = new _render_GraphicBranch__WEBPACK_IMPORTED_MODULE_2__.GraphicBranch();
+            branch.add(graphic);
+            branch.groupNodeId = this.groupNodeId;
+            graphic = this.context.createGraphicBranch(branch, _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_0__.Transform.identity);
+        }
         return graphic;
     }
     /** Output graphics for all accumulated tiles. */
@@ -148705,12 +148825,17 @@ class TileTreeReference /* implements RenderMemory.Consumer */ {
             appearanceProvider: this.getAppearanceProvider(tree),
             hiddenLineSettings: this.getHiddenLineSettings(tree),
             animationTransformNodeId: this.getAnimationTransformNodeId(tree),
+            groupNodeId: this.getGroupNodeId(tree),
         });
     }
     /** @internal */
     getAnimationTransformNodeId(_tree) {
         return undefined;
     }
+    /** @internal */
+    getGroupNodeId(_tree) {
+        return undefined;
+    }
     /** Supply transform from this tile tree reference's location to iModel coordinate space.
      * @returns undefined if the TileTree is not yet loaded.
      */
@@ -172310,7 +172435,9 @@ class Geometry {
     /**
      * Clone an array whose members have type `T`, which implements the clone method.
      * * If the clone method returns `undefined`, then `undefined` is forced into the cloned array.
+     * @deprecated in 4.x. Use cloneArray.
      */
+    // eslint-disable-next-line deprecation/deprecation
     static cloneMembers(array) {
         if (array === undefined)
             return undefined;
@@ -172320,6 +172447,18 @@ class Geometry {
         }
         return clonedArray;
     }
+    /**
+     * Clone an array whose members have the cloneable type `T`.
+     */
+    static cloneArray(array) {
+        if (array === undefined)
+            return undefined;
+        const clonedArray = [];
+        for (const element of array) {
+            clonedArray.push(element.clone());
+        }
+        return clonedArray;
+    }
 }
 /** Tolerance for small distances in metric coordinates. */
 Geometry.smallMetricDistance = 1.0e-6;
@@ -183243,7 +183382,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "BSplineWrapMode": () => (/* reexport safe */ _bspline_KnotVector__WEBPACK_IMPORTED_MODULE_108__.BSplineWrapMode),
 /* harmony export */   "BagOfCurves": () => (/* reexport safe */ _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_64__.BagOfCurves),
 /* harmony export */   "BarycentricTriangle": () => (/* reexport safe */ _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_3__.BarycentricTriangle),
-/* harmony export */   "BentleyGeometryFlatBuffer": () => (/* reexport safe */ _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_128__.BentleyGeometryFlatBuffer),
+/* harmony export */   "BentleyGeometryFlatBuffer": () => (/* reexport safe */ _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_129__.BentleyGeometryFlatBuffer),
 /* harmony export */   "Bezier1dNd": () => (/* reexport safe */ _bspline_Bezier1dNd__WEBPACK_IMPORTED_MODULE_98__.Bezier1dNd),
 /* harmony export */   "BezierCoffs": () => (/* reexport safe */ _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_51__.BezierCoffs),
 /* harmony export */   "BezierCurve3d": () => (/* reexport safe */ _bspline_BezierCurve3d__WEBPACK_IMPORTED_MODULE_100__.BezierCurve3d),
@@ -183292,7 +183431,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "CurveSearchStatus": () => (/* reexport safe */ _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_66__.CurveSearchStatus),
 /* harmony export */   "CutLoop": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.CutLoop),
 /* harmony export */   "CutLoopMergeContext": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.CutLoopMergeContext),
-/* harmony export */   "DeepCompare": () => (/* reexport safe */ _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_126__.DeepCompare),
+/* harmony export */   "DeepCompare": () => (/* reexport safe */ _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_127__.DeepCompare),
 /* harmony export */   "Degree2PowerPolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.Degree2PowerPolynomial),
 /* harmony export */   "Degree3PowerPolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.Degree3PowerPolynomial),
 /* harmony export */   "Degree4PowerPolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.Degree4PowerPolynomial),
@@ -183302,6 +183441,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "EllipsoidPatch": () => (/* reexport safe */ _geometry3d_Ellipsoid__WEBPACK_IMPORTED_MODULE_5__.EllipsoidPatch),
 /* harmony export */   "FacetFaceData": () => (/* reexport safe */ _polyface_FacetFaceData__WEBPACK_IMPORTED_MODULE_111__.FacetFaceData),
 /* harmony export */   "FacetIntersectOptions": () => (/* reexport safe */ _polyface_FacetLocationDetail__WEBPACK_IMPORTED_MODULE_113__.FacetIntersectOptions),
+/* harmony export */   "FacetLocationDetailPair": () => (/* reexport safe */ _polyface_FacetLocationDetail__WEBPACK_IMPORTED_MODULE_113__.FacetLocationDetailPair),
 /* harmony export */   "FrameBuilder": () => (/* reexport safe */ _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_6__.FrameBuilder),
 /* harmony export */   "GaussMapper": () => (/* reexport safe */ _numerics_Quadrature__WEBPACK_IMPORTED_MODULE_56__.GaussMapper),
 /* harmony export */   "GeodesicPathPoint": () => (/* reexport safe */ _geometry3d_Ellipsoid__WEBPACK_IMPORTED_MODULE_5__.GeodesicPathPoint),
@@ -183315,10 +183455,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "GrowableFloat64Array": () => (/* reexport safe */ _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_10__.GrowableFloat64Array),
 /* harmony export */   "GrowableXYArray": () => (/* reexport safe */ _geometry3d_GrowableXYArray__WEBPACK_IMPORTED_MODULE_11__.GrowableXYArray),
 /* harmony export */   "GrowableXYZArray": () => (/* reexport safe */ _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_12__.GrowableXYZArray),
-/* harmony export */   "HalfEdge": () => (/* reexport safe */ _topology_Graph__WEBPACK_IMPORTED_MODULE_122__.HalfEdge),
-/* harmony export */   "HalfEdgeGraph": () => (/* reexport safe */ _topology_Graph__WEBPACK_IMPORTED_MODULE_122__.HalfEdgeGraph),
-/* harmony export */   "HalfEdgeMask": () => (/* reexport safe */ _topology_Graph__WEBPACK_IMPORTED_MODULE_122__.HalfEdgeMask),
-/* harmony export */   "IModelJson": () => (/* reexport safe */ _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_125__.IModelJson),
+/* harmony export */   "IModelJson": () => (/* reexport safe */ _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_126__.IModelJson),
 /* harmony export */   "ImplicitLineXY": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.ImplicitLineXY),
 /* harmony export */   "IndexedCollectionInterval": () => (/* reexport safe */ _geometry3d_IndexedCollectionInterval__WEBPACK_IMPORTED_MODULE_13__.IndexedCollectionInterval),
 /* harmony export */   "IndexedPolyface": () => (/* reexport safe */ _polyface_Polyface__WEBPACK_IMPORTED_MODULE_112__.IndexedPolyface),
@@ -183337,6 +183474,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "KnotVector": () => (/* reexport safe */ _bspline_KnotVector__WEBPACK_IMPORTED_MODULE_108__.KnotVector),
 /* harmony export */   "LineSegment3d": () => (/* reexport safe */ _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_72__.LineSegment3d),
 /* harmony export */   "LineString3d": () => (/* reexport safe */ _curve_LineString3d__WEBPACK_IMPORTED_MODULE_73__.LineString3d),
+/* harmony export */   "LineString3dRangeTreeContext": () => (/* reexport safe */ _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_122__.LineString3dRangeTreeContext),
 /* harmony export */   "LinearSweep": () => (/* reexport safe */ _solid_LinearSweep__WEBPACK_IMPORTED_MODULE_90__.LinearSweep),
 /* harmony export */   "LongitudeLatitudeNumber": () => (/* reexport safe */ _geometry3d_LongitudeLatitudeAltitude__WEBPACK_IMPORTED_MODULE_2__.LongitudeLatitudeNumber),
 /* harmony export */   "Loop": () => (/* reexport safe */ _curve_Loop__WEBPACK_IMPORTED_MODULE_74__.Loop),
@@ -183372,6 +183510,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "Point3dArray": () => (/* reexport safe */ _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.Point3dArray),
 /* harmony export */   "Point3dArrayCarrier": () => (/* reexport safe */ _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_25__.Point3dArrayCarrier),
 /* harmony export */   "Point3dArrayPolygonOps": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.Point3dArrayPolygonOps),
+/* harmony export */   "Point3dArrayRangeTreeContext": () => (/* reexport safe */ _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_121__.Point3dArrayRangeTreeContext),
 /* harmony export */   "Point4d": () => (/* reexport safe */ _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_47__.Point4d),
 /* harmony export */   "Point4dArray": () => (/* reexport safe */ _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.Point4dArray),
 /* harmony export */   "PointString3d": () => (/* reexport safe */ _curve_PointString3d__WEBPACK_IMPORTED_MODULE_80__.PointString3d),
@@ -183381,8 +183520,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "PolyfaceClip": () => (/* reexport safe */ _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_120__.PolyfaceClip),
 /* harmony export */   "PolyfaceData": () => (/* reexport safe */ _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_118__.PolyfaceData),
 /* harmony export */   "PolyfaceQuery": () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_119__.PolyfaceQuery),
+/* harmony export */   "PolyfaceRangeTreeContext": () => (/* reexport safe */ _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__.PolyfaceRangeTreeContext),
 /* harmony export */   "PolygonLocation": () => (/* reexport safe */ _Geometry__WEBPACK_IMPORTED_MODULE_36__.PolygonLocation),
 /* harmony export */   "PolygonLocationDetail": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.PolygonLocationDetail),
+/* harmony export */   "PolygonLocationDetailPair": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.PolygonLocationDetailPair),
 /* harmony export */   "PolygonOps": () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.PolygonOps),
 /* harmony export */   "PolylineOps": () => (/* reexport safe */ _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_26__.PolylineOps),
 /* harmony export */   "PowerPolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.PowerPolynomial),
@@ -183403,24 +183544,24 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "RegionOps": () => (/* reexport safe */ _curve_RegionOps__WEBPACK_IMPORTED_MODULE_79__.RegionOps),
 /* harmony export */   "RotationalSweep": () => (/* reexport safe */ _solid_RotationalSweep__WEBPACK_IMPORTED_MODULE_91__.RotationalSweep),
 /* harmony export */   "RuledSweep": () => (/* reexport safe */ _solid_RuledSweep__WEBPACK_IMPORTED_MODULE_92__.RuledSweep),
-/* harmony export */   "Sample": () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_127__.Sample),
+/* harmony export */   "Sample": () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_128__.Sample),
 /* harmony export */   "Segment1d": () => (/* reexport safe */ _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_31__.Segment1d),
 /* harmony export */   "SineCosinePolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.SineCosinePolynomial),
 /* harmony export */   "SmallSystem": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.SmallSystem),
 /* harmony export */   "SmoothTransformBetweenFrusta": () => (/* reexport safe */ _geometry3d_FrustumAnimation__WEBPACK_IMPORTED_MODULE_7__.SmoothTransformBetweenFrusta),
 /* harmony export */   "SolidPrimitive": () => (/* reexport safe */ _solid_SolidPrimitive__WEBPACK_IMPORTED_MODULE_93__.SolidPrimitive),
-/* harmony export */   "SpacePolygonTriangulation": () => (/* reexport safe */ _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_124__.SpacePolygonTriangulation),
+/* harmony export */   "SpacePolygonTriangulation": () => (/* reexport safe */ _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_125__.SpacePolygonTriangulation),
 /* harmony export */   "Sphere": () => (/* reexport safe */ _solid_Sphere__WEBPACK_IMPORTED_MODULE_94__.Sphere),
 /* harmony export */   "SphereImplicit": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.SphereImplicit),
 /* harmony export */   "StandardViewIndex": () => (/* reexport safe */ _Geometry__WEBPACK_IMPORTED_MODULE_36__.StandardViewIndex),
-/* harmony export */   "SteppedIndexFunctionFactory": () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_127__.SteppedIndexFunctionFactory),
+/* harmony export */   "SteppedIndexFunctionFactory": () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_128__.SteppedIndexFunctionFactory),
 /* harmony export */   "StringifiedClipVector": () => (/* reexport safe */ _clipping_ClipVector__WEBPACK_IMPORTED_MODULE_43__.StringifiedClipVector),
 /* harmony export */   "StrokeCountMap": () => (/* reexport safe */ _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_87__.StrokeCountMap),
 /* harmony export */   "StrokeOptions": () => (/* reexport safe */ _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_82__.StrokeOptions),
 /* harmony export */   "SweepContour": () => (/* reexport safe */ _solid_SweepContour__WEBPACK_IMPORTED_MODULE_95__.SweepContour),
 /* harmony export */   "SweepLineStringToFacetsOptions": () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_119__.SweepLineStringToFacetsOptions),
-/* harmony export */   "TaggedNumericConstants": () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_121__.TaggedNumericConstants),
-/* harmony export */   "TaggedNumericData": () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_121__.TaggedNumericData),
+/* harmony export */   "TaggedNumericConstants": () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_124__.TaggedNumericConstants),
+/* harmony export */   "TaggedNumericData": () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_124__.TaggedNumericData),
 /* harmony export */   "TorusImplicit": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.TorusImplicit),
 /* harmony export */   "TorusPipe": () => (/* reexport safe */ _solid_TorusPipe__WEBPACK_IMPORTED_MODULE_96__.TorusPipe),
 /* harmony export */   "Transform": () => (/* reexport safe */ _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_32__.Transform),
@@ -183428,7 +183569,6 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "TriDiagonalSystem": () => (/* reexport safe */ _numerics_TriDiagonalSystem__WEBPACK_IMPORTED_MODULE_58__.TriDiagonalSystem),
 /* harmony export */   "TriangleLocationDetail": () => (/* reexport safe */ _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_3__.TriangleLocationDetail),
 /* harmony export */   "TriangularFacetLocationDetail": () => (/* reexport safe */ _polyface_FacetLocationDetail__WEBPACK_IMPORTED_MODULE_113__.TriangularFacetLocationDetail),
-/* harmony export */   "Triangulator": () => (/* reexport safe */ _topology_Triangulation__WEBPACK_IMPORTED_MODULE_123__.Triangulator),
 /* harmony export */   "TrigPolynomial": () => (/* reexport safe */ _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_55__.TrigPolynomial),
 /* harmony export */   "UVSelect": () => (/* reexport safe */ _bspline_BSplineSurface__WEBPACK_IMPORTED_MODULE_106__.UVSelect),
 /* harmony export */   "UVSurfaceOps": () => (/* reexport safe */ _geometry3d_UVSurfaceOps__WEBPACK_IMPORTED_MODULE_33__.UVSurfaceOps),
@@ -183567,14 +183707,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_118__ = __webpack_require__(/*! ./polyface/PolyfaceData */ "../../core/geometry/lib/esm/polyface/PolyfaceData.js");
 /* harmony import */ var _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_119__ = __webpack_require__(/*! ./polyface/PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
 /* harmony import */ var _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_120__ = __webpack_require__(/*! ./polyface/PolyfaceClip */ "../../core/geometry/lib/esm/polyface/PolyfaceClip.js");
-/* harmony import */ var _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_121__ = __webpack_require__(/*! ./polyface/TaggedNumericData */ "../../core/geometry/lib/esm/polyface/TaggedNumericData.js");
-/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_122__ = __webpack_require__(/*! ./topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_123__ = __webpack_require__(/*! ./topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
-/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_124__ = __webpack_require__(/*! ./topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
-/* harmony import */ var _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_125__ = __webpack_require__(/*! ./serialization/IModelJsonSchema */ "../../core/geometry/lib/esm/serialization/IModelJsonSchema.js");
-/* harmony import */ var _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_126__ = __webpack_require__(/*! ./serialization/DeepCompare */ "../../core/geometry/lib/esm/serialization/DeepCompare.js");
-/* harmony import */ var _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_127__ = __webpack_require__(/*! ./serialization/GeometrySamples */ "../../core/geometry/lib/esm/serialization/GeometrySamples.js");
-/* harmony import */ var _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_128__ = __webpack_require__(/*! ./serialization/BentleyGeometryFlatBuffer */ "../../core/geometry/lib/esm/serialization/BentleyGeometryFlatBuffer.js");
+/* harmony import */ var _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_121__ = __webpack_require__(/*! ./polyface/RangeTree/Point3dArrayRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js");
+/* harmony import */ var _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_122__ = __webpack_require__(/*! ./polyface/RangeTree/LineString3dRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js");
+/* harmony import */ var _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__ = __webpack_require__(/*! ./polyface/RangeTree/PolyfaceRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js");
+/* harmony import */ var _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_124__ = __webpack_require__(/*! ./polyface/TaggedNumericData */ "../../core/geometry/lib/esm/polyface/TaggedNumericData.js");
+/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_125__ = __webpack_require__(/*! ./topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
+/* harmony import */ var _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_126__ = __webpack_require__(/*! ./serialization/IModelJsonSchema */ "../../core/geometry/lib/esm/serialization/IModelJsonSchema.js");
+/* harmony import */ var _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_127__ = __webpack_require__(/*! ./serialization/DeepCompare */ "../../core/geometry/lib/esm/serialization/DeepCompare.js");
+/* harmony import */ var _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_128__ = __webpack_require__(/*! ./serialization/GeometrySamples */ "../../core/geometry/lib/esm/serialization/GeometrySamples.js");
+/* harmony import */ var _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_129__ = __webpack_require__(/*! ./serialization/BentleyGeometryFlatBuffer */ "../../core/geometry/lib/esm/serialization/BentleyGeometryFlatBuffer.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -183825,6 +183966,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 /***/ }),
@@ -185708,7 +185850,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         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); // local detail related to the child curve
+        const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result?.childDetail); // local detail related to the child curve
         const endFraction = startFraction + (signedDistance / this._totalLength);
         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;
@@ -185819,8 +185961,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * 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.
+     * @param childDetail the local (fragment) detail, captured.
+     * @returns newly allocated global (chain) detail with `childDetail` field pointing to the input, and `a` field copied from the input
      */
     computeChainDetail(childDetail) {
         if (!childDetail.curve)
@@ -186466,8 +186608,7 @@ __webpack_require__.r(__webpack_exports__);
  * @module Curve
  */
 
-/** module Curve */
-/** enumeration of condition for extending a curve beyond start or end point.
+/** Enumeration of condition for extending a curve beyond start or end point.
  * * Not all CurvePrimitives support these modes.
  * @public
  */
@@ -186484,10 +186625,12 @@ var CurveExtendMode;
  * @public
  */
 class CurveExtendOptions {
-    /** Given an ExtendParameter, isolate the particular CurveExtendOptions in effect at an end.
-     * * Return undefined if `param === false`
-     * * return the (strongly typed) pointer to the param if it is a single CurveExtendOptions.
-     * * Return dereferenced array entry 0 or 1 if the param is an array of CurveExtendOptions.
+    /**
+     * Given an VariantCurveExtendParameter, isolate the particular CurveExtendMode in effect at an end.
+     * * Return `CurveExtendMode.None` if `param === false`.
+     * * Return `CurveExtendMode.OnCurve` if `param === true`.
+     * * Return the param if it is a single CurveExtendMode.
+     * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.
      */
     static resolveVariantCurveExtendParameterToCurveExtendMode(param, endIndex) {
         if (param === false)
@@ -187254,17 +187397,14 @@ var CurveSearchStatus;
     CurveSearchStatus[CurveSearchStatus["stoppedAtBoundary"] = 2] = "stoppedAtBoundary";
 })(CurveSearchStatus || (CurveSearchStatus = {}));
 /**
- * Use to update a vector in case where source and prior result are both possibly undefined.
+ * Use to update a cloneable object when source and/or prior result are possibly undefined.
  * * Any undefined source returns undefined.
  * * For defined source, reuse optional result if available.
  * @param source optional source
  * @param result optional result
  */
-function optionalVectorUpdate(source, result) {
-    if (source) {
-        return source.clone(result);
-    }
-    return undefined;
+function optionalUpdate(source, result) {
+    return source ? source.clone(result) : undefined;
 }
 /**
  * CurveLocationDetail carries point and parameter data about a point evaluated on a curve.
@@ -187331,10 +187471,11 @@ class CurveLocationDetail {
         result.curve = this.curve;
         result.fraction = this.fraction;
         result.fraction1 = this.fraction1;
-        result.point1 = this.point1;
+        result.point1 = optionalUpdate(this.point1, result.point1);
         result.point.setFromPoint3d(this.point);
-        result.vectorInCurveLocationDetail = optionalVectorUpdate(this.vectorInCurveLocationDetail, result.vectorInCurveLocationDetail);
+        result.vectorInCurveLocationDetail = optionalUpdate(this.vectorInCurveLocationDetail, result.vectorInCurveLocationDetail);
         result.a = this.a;
+        result.childDetail = optionalUpdate(this.childDetail, result.childDetail);
         result.curveSearchStatus = this.curveSearchStatus;
         return result;
     }
@@ -187349,8 +187490,8 @@ class CurveLocationDetail {
      */
     setFP(fraction, point, vector, a = 0.0) {
         this.fraction = fraction;
-        this.point.setFrom(point);
-        this.vectorInCurveLocationDetail = optionalVectorUpdate(vector, this.vectorInCurveLocationDetail);
+        this.point.setFromPoint3d(point);
+        this.vectorInCurveLocationDetail = optionalUpdate(vector, this.vectorInCurveLocationDetail);
         this.a = a;
     }
     /**
@@ -187386,6 +187527,7 @@ class CurveLocationDetail {
         result.point.setFromPoint3d(point);
         result.vectorInCurveLocationDetail = undefined;
         result.a = 0.0;
+        result.childDetail = undefined;
         result.curveSearchStatus = undefined;
         return result;
     }
@@ -187405,6 +187547,7 @@ class CurveLocationDetail {
         result.point.setFromPoint3d(point);
         result.vectorInCurveLocationDetail = undefined;
         result.a = distance;
+        result.childDetail = undefined;
         result.curveSearchStatus = status;
         return result;
     }
@@ -187428,9 +187571,10 @@ class CurveLocationDetail {
         result = result ? result : new CurveLocationDetail();
         result.curve = curve;
         result.fraction = endFraction;
-        result.point = curve.fractionToPoint(endFraction, result.point);
+        curve.fractionToPoint(endFraction, result.point);
         result.vectorInCurveLocationDetail = undefined;
         result.a = a;
+        result.childDetail = undefined;
         result.curveSearchStatus = status;
         return result;
     }
@@ -187439,10 +187583,11 @@ class CurveLocationDetail {
         result = result ? result : new CurveLocationDetail();
         result.curve = curve;
         result.fraction = fraction;
-        result.point = curve.fractionToPoint(fraction);
+        curve.fractionToPoint(fraction, result.point);
         result.vectorInCurveLocationDetail = undefined;
-        result.curveSearchStatus = undefined;
         result.a = 0.0;
+        result.childDetail = undefined;
+        result.curveSearchStatus = undefined;
         return result;
     }
     /** Create with CurvePrimitive pointer and fraction for evaluation. */
@@ -187451,10 +187596,11 @@ class CurveLocationDetail {
         result.curve = curve;
         result.fraction = fraction;
         const ray = curve.fractionToPointAndDerivative(fraction);
-        result.point = ray.origin;
+        result.point.setFromPoint3d(ray.origin);
         result.vectorInCurveLocationDetail = ray.direction;
-        result.curveSearchStatus = undefined;
         result.a = 0.0;
+        result.childDetail = undefined;
+        result.curveSearchStatus = undefined;
         return result;
     }
     /** Create with CurvePrimitive pointer and 2 fractions for evaluation. */
@@ -187462,12 +187608,13 @@ class CurveLocationDetail {
         result = result ? result : new CurveLocationDetail();
         result.curve = curve;
         result.fraction = fraction0;
-        result.point = curve.fractionToPoint(fraction0);
+        curve.fractionToPoint(fraction0, result.point);
         result.fraction1 = fraction1;
-        result.point1 = curve.fractionToPoint(fraction1);
+        result.point1 = curve.fractionToPoint(fraction1, result.point1);
         result.vectorInCurveLocationDetail = undefined;
-        result.curveSearchStatus = undefined;
         result.a = 0.0;
+        result.childDetail = undefined;
+        result.curveSearchStatus = undefined;
         return result;
     }
     /** Create with CurvePrimitive pointer, fraction, and point coordinates. */
@@ -187478,6 +187625,7 @@ class CurveLocationDetail {
         result.point.setFromPoint3d(point);
         result.vectorInCurveLocationDetail = undefined;
         result.a = a;
+        result.childDetail = undefined;
         result.curveSearchStatus = undefined;
         return result;
     }
@@ -188780,21 +188928,30 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "LineSegment3d": () => (/* binding */ LineSegment3d)
 /* harmony export */ });
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
-/* harmony import */ var _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../numerics/BezierPolynomials */ "../../core/geometry/lib/esm/numerics/BezierPolynomials.js");
-/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.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 _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
+/* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__ = __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 _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../numerics/BezierPolynomials */ "../../core/geometry/lib/esm/numerics/BezierPolynomials.js");
+/* harmony import */ var _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../numerics/Polynomials */ "../../core/geometry/lib/esm/numerics/Polynomials.js");
+/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
+/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
+/* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+
+
+
 
 
 
@@ -188821,7 +188978,7 @@ __webpack_require__.r(__webpack_exports__);
  * ```
  * @public
  */
-class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePrimitive {
+class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive {
     /** Test if `other` is of class `LineSegment3d` */
     isSameGeometryClass(other) {
         return other instanceof LineSegment3d;
@@ -188889,7 +189046,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     }
     /** Return the point and derivative vector at fractional position along the line segment. */
     fractionToPointAndDerivative(fraction, result) {
-        result = result ? result : _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_1__.Ray3d.createZero();
+        result = result ? result : _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_2__.Ray3d.createZero();
         result.direction.setStartEnd(this._point0, this._point1);
         this._point0.interpolate(fraction, this._point1, result.origin);
         return result;
@@ -188901,7 +189058,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
      * * y axis is the second derivative, i.e. 000
      */
     fractionToPointAnd2Derivatives(fraction, result) {
-        result = result ? result : _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_2__.Plane3dByOriginAndVectors.createXYPlane();
+        result = result ? result : _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_3__.Plane3dByOriginAndVectors.createXYPlane();
         result.vectorU.setStartEnd(this._point0, this._point1);
         result.vectorV.set(0, 0, 0);
         this._point0.interpolate(fraction, this._point1, result.origin);
@@ -188944,7 +189101,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
             result._point1.set(x1, y1, z);
             return result;
         }
-        return new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(x0, y0, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(x1, y1, z));
+        return new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.create(x0, y0, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.create(x1, y1, z));
     }
     /**
      * Create a LineSegment3d from xy coordinates of start and end, with common z.
@@ -188961,7 +189118,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
             result._point1.set(x1, y1, z1);
             return result;
         }
-        return new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(x0, y0, z0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(x1, y1, z1));
+        return new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.create(x0, y0, z0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.create(x1, y1, z1));
     }
     /** Return the point at fractional position along the line segment. */
     fractionToPoint(fraction, result) {
@@ -188984,19 +189141,118 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
      * @param spacePoint point in space
      * @param extend if false, only return points within the bounded line segment. If true, allow the point to be on
      * the unbounded line that contains the bounded segment.
+     * @param result optional pre-allocated object to populate and return
+     * @returns detail, with `a` field set to the distance from `spacePoint` to the closest point
      */
     closestPoint(spacePoint, extend, result) {
         let fraction = spacePoint.fractionOfProjectionToLine(this._point0, this._point1, 0.0);
-        fraction = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_4__.CurveExtendOptions.correctFraction(extend, fraction);
-        result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.create(this, result);
-        // remark: This can be done by result.setFP (fraction, thePoint, undefined, a)
-        //   but that creates a temporary point.
+        fraction = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_5__.CurveExtendOptions.correctFraction(extend, fraction);
+        result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.create(this, result);
         result.fraction = fraction;
         this._point0.interpolate(fraction, this._point1, result.point);
         result.vectorInCurveLocationDetail = undefined;
         result.a = result.point.distance(spacePoint);
         return result;
     }
+    /**
+     * Compute the closest approach between a pair of line segments.
+     * * The approach distance is returned in the `a` fields of the details.
+     * @param segmentA first line segment
+     * @param extendA how to extend segmentA forward/backward
+     * @param segmentB second line segment
+     * @param extendB how to extend segmentB forward/backward
+     * @param result optional pre-allocated object to populate and return
+     * @returns pair of details, one per segment, each with `a` field set to the closest approach distance
+     */
+    static closestApproach(segmentA, extendA, segmentB, extendB, result) {
+        const unboundedFractions = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_7__.Vector2d.create();
+        if (result === undefined)
+            result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.create(), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.create());
+        if (_numerics_Polynomials__WEBPACK_IMPORTED_MODULE_8__.SmallSystem.lineSegment3dClosestApproachUnbounded(segmentA._point0, segmentA._point1, segmentB._point0, segmentB._point1, unboundedFractions)) {
+            // There is a simple approach between the unbounded segments.  Maybe its a really easy case ...
+            const fractionA = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_5__.CurveExtendOptions.correctFraction(extendA, unboundedFractions.x);
+            const fractionB = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_5__.CurveExtendOptions.correctFraction(extendB, unboundedFractions.y);
+            // if neither fraction was corrected, just accept !!!
+            if (fractionA === unboundedFractions.x && fractionB === unboundedFractions.y) {
+                _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentA, fractionA, result.detailA);
+                _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentB, fractionB, result.detailB);
+                result.detailA.a = result.detailB.a = result.detailA.point.distance(result.detailB.point);
+                return result;
+            }
+            // One or both of the fractions were clamped back to an endpoint.
+            // Claim: (????!!!????) The only proximity candidates that matter are from clamped point onto the other.
+            if (fractionA !== unboundedFractions.x && fractionB !== unboundedFractions.y) {
+                // Fill in (in the result) both individual details with "projected" points and distance.
+                // The "loser" will have its contents replaced.
+                const clampedPointOnA = fractionA < 0.5 ? segmentA._point0 : segmentA._point1;
+                const clampedPointOnB = fractionB < 0.5 ? segmentB._point0 : segmentB._point1;
+                segmentB.closestPoint(clampedPointOnA, extendB, result.detailB);
+                segmentA.closestPoint(clampedPointOnB, extendA, result.detailA);
+                if (result.detailA.a <= result.detailB.a) {
+                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(segmentB, fractionB, clampedPointOnB, result.detailB);
+                }
+                else {
+                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(segmentA, fractionA, clampedPointOnA, result.detailA);
+                }
+            }
+            else if (fractionB !== unboundedFractions.y) {
+                // B (only) was clamped.
+                const clampedPointOnB = fractionB < 0.5 ? segmentB._point0 : segmentB._point1;
+                segmentA.closestPoint(clampedPointOnB, extendA, result.detailA);
+                result.detailB.setCurve(segmentB);
+                result.detailB.point.setFrom(clampedPointOnB);
+                result.detailB.fraction = fractionB;
+            }
+            else {
+                // fractionA was clamped.
+                const clampedPointOnA = fractionA < 0.5 ? segmentA._point0 : segmentA._point1;
+                segmentB.closestPoint(clampedPointOnA, extendB, result.detailB);
+                result.detailA.setCurve(segmentA);
+                result.detailA.point.setFrom(clampedPointOnA);
+                result.detailA.fraction = fractionA;
+            }
+            result.detailA.a = result.detailB.a = result.detailA.point.distance(result.detailB.point);
+            return result;
+        }
+        // (probably? certainly?) parallel (possibly coincident) lines.
+        // run all 4 endpoint-to-other cases . . . reassemble carefully ...
+        const resultSet = [
+            segmentA.closestPoint(segmentB._point0, extendA),
+            segmentA.closestPoint(segmentB._point1, extendA),
+            segmentB.closestPoint(segmentA._point0, extendB),
+            segmentB.closestPoint(segmentA._point1, extendB),
+        ];
+        let dMin = resultSet[0].a;
+        let iMin = 0;
+        for (let i = 1; i < 4; i++) {
+            if (resultSet[i].a < dMin) {
+                iMin = i;
+                dMin = resultSet[i].a;
+            }
+        }
+        if (iMin === 0) {
+            resultSet[0].clone(result.detailA);
+            _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentB, 0.0, result.detailB);
+            result.detailB.a = result.detailA.a;
+        }
+        else if (iMin === 1) {
+            resultSet[1].clone(result.detailA);
+            _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentB, 1.0, result.detailB);
+            result.detailB.a = result.detailA.a;
+        }
+        else if (iMin === 2) {
+            resultSet[2].clone(result.detailB);
+            _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentA, 0.0, result.detailA);
+            result.detailA.a = result.detailB.a;
+        }
+        else {
+            (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(iMin === 3);
+            resultSet[3].clone(result.detailB);
+            _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(segmentA, 1.0, result.detailA);
+            result.detailA.a = result.detailB.a;
+        }
+        return result;
+    }
     /** Swap the endpoint references. */
     reverseInPlace() {
         const a = this._point0;
@@ -189011,8 +189267,8 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     }
     /** Test if both endpoints are in a plane (within tolerance) */
     isInPlane(plane) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.isSmallMetricDistance(plane.altitude(this._point0))
-            && _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.isSmallMetricDistance(plane.altitude(this._point1));
+        return _Geometry__WEBPACK_IMPORTED_MODULE_9__.Geometry.isSmallMetricDistance(plane.altitude(this._point0))
+            && _Geometry__WEBPACK_IMPORTED_MODULE_9__.Geometry.isSmallMetricDistance(plane.altitude(this._point1));
     }
     /**
      * Compute points of simple (transverse) with a plane.
@@ -189021,12 +189277,12 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     appendPlaneIntersectionPoints(plane, result) {
         const h0 = plane.altitude(this._point0);
         const h1 = plane.altitude(this._point1);
-        const fraction = _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_7__.Order2Bezier.solveCoffs(h0, h1);
+        const fraction = _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_10__.Order2Bezier.solveCoffs(h0, h1);
         let numIntersection = 0;
         if (fraction !== undefined) {
             numIntersection++;
-            const detail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveFractionPoint(this, fraction, this.fractionToPoint(fraction));
-            detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveIntervalRole.isolated;
+            const detail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(this, fraction, this.fractionToPoint(fraction));
+            detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveIntervalRole.isolated;
             result.push(detail);
         }
         return numIntersection;
@@ -189085,7 +189341,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     }
     /** Create a new `LineSegment3d` with coordinates from json object.   See `setFromJSON` for object layout description. */
     static fromJSON(json) {
-        const result = new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.createZero(), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create());
+        const result = new LineSegment3d(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.createZero(), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Point3d.create());
         result.setFromJSON(json);
         return result;
     }
@@ -189149,7 +189405,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     rangeBetweenFractions(fraction0, fraction1, transform) {
         // (This is cheap -- don't bother testing for fraction0===fraction1)
         if (!transform) {
-            const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_8__.Range3d.create();
+            const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_11__.Range3d.create();
             range.extendInterpolated(this._point0, fraction0, this._point1);
             range.extendInterpolated(this._point0, fraction1, this._point1);
             return range;
@@ -189160,17 +189416,17 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
             transform.multiplyPoint3d(point0, point0);
             transform.multiplyPoint3d(point1, point1);
         }
-        return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_8__.Range3d.create(point0, point1);
+        return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_11__.Range3d.create(point0, point1);
     }
     /**
      * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).
      * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object
      */
     constructOffsetXY(offsetDistanceOrOptions) {
-        const offsetVec = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.createStartEnd(this._point0, this._point1);
+        const offsetVec = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Vector3d.createStartEnd(this._point0, this._point1);
         if (offsetVec.normalizeInPlace()) {
             offsetVec.rotate90CCWXY(offsetVec);
-            const offsetDist = _OffsetOptions__WEBPACK_IMPORTED_MODULE_9__.OffsetOptions.getOffsetDistance(offsetDistanceOrOptions);
+            const offsetDist = _OffsetOptions__WEBPACK_IMPORTED_MODULE_12__.OffsetOptions.getOffsetDistance(offsetDistanceOrOptions);
             return LineSegment3d.create(this._point0.plusScaled(offsetVec, offsetDist), this._point1.plusScaled(offsetVec, offsetDist));
         }
         return undefined;
@@ -189184,7 +189440,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
      * 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_13__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
     }
 }
 
@@ -189241,7 +189497,6 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/* eslint-disable @typescript-eslint/naming-convention, no-empty */
 /**
  * Starting with baseIndex and moving index by stepDirection:
  * If the vector from baseIndex to baseIndex +1 crossed with vectorA can be normalized, accumulate it (scaled) to normal.
@@ -189360,10 +189615,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         result.addPoints(points);
         return result;
     }
-    /**
-     * Create a linestring, capturing the given GrowableXYZArray as the points.
-     * Point3d, Point2d, `[1,2,3]', array of any of those, or GrowableXYZArray
-     */
+    /** Create a linestring, capturing the given GrowableXYZArray as the points. */
     static createCapture(points) {
         return new LineString3d(points);
     }
@@ -189387,7 +189639,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         return result;
     }
     /**
-     * Add points to the linestring.
+     * Add copies of points to the linestring.
      * Valid inputs are:
      * * a Point2d
      * * a point3d
@@ -189773,24 +190025,33 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         return result;
     }
     /**
-     * Convert a segment index and local fraction to a global fraction.
+     * Convert a segment index and local fraction to a global linestring fraction.
      * @param index index of segment being evaluated
      * @param localFraction local fraction in [0,1] within the segment
+     * @param numSegment number N of segments in the linestring
      * @return global fraction f in [0,1] such that the segment is parameterized by index/N <= f <= (index+1)/N.
      */
-    segmentIndexAndLocalFractionToGlobalFraction(index, localFraction) {
-        const numSegment = this._points.length - 1;
+    static mapLocalToGlobalFraction(index, localFraction, numSegment) {
         if (numSegment < 1)
             return 0.0;
         return (index + localFraction) / numSegment;
     }
+    /**
+     * Convert a segment index and local fraction to a global linestring fraction.
+     * @param index index of segment being evaluated
+     * @param localFraction local fraction in [0,1] within the segment
+     * @return global fraction f in [0,1] such that the segment is parameterized by index/N <= f <= (index+1)/N.
+     */
+    segmentIndexAndLocalFractionToGlobalFraction(index, localFraction) {
+        return LineString3d.mapLocalToGlobalFraction(index, localFraction, this._points.length - 1);
+    }
     /**
      * Convert a global fraction to a segment index and local fraction.
      * @param globalFraction a fraction f in [0,1] in the linestring parameterization, where the i_th segment
      * (0 <= i < N) is parameterized by i/N <= f <= (i+1)/N.
+     * @returns segment index and local fraction
      */
-    globalFractionToSegmentIndexAndLocalFraction(globalFraction) {
-        const numSegment = this._points.length - 1;
+    static mapGlobalToLocalFraction(globalFraction, numSegment) {
         if (numSegment < 1)
             return { index: 0, fraction: 0.0 };
         const scaledGlobalFraction = globalFraction * numSegment;
@@ -189801,8 +190062,17 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
             segmentIndex = numSegment - 1;
         else // globalFraction in [0,1]
             segmentIndex = Math.floor(scaledGlobalFraction);
-        const localFraction = scaledGlobalFraction - segmentIndex;
-        return { index: segmentIndex, fraction: localFraction };
+        return { index: segmentIndex, fraction: scaledGlobalFraction - segmentIndex };
+    }
+    /**
+     * Convert a global linestring fraction to a segment index and local fraction.
+     * @param globalFraction a fraction f in [0,1] in the linestring parameterization, where the i_th segment
+     * (0 <= i < N) is parameterized by i/N <= f <= (i+1)/N.
+     * @param numSegment number N of segments in the linestring
+     * @returns segment index and local fraction
+     */
+    globalFractionToSegmentIndexAndLocalFraction(globalFraction) {
+        return LineString3d.mapGlobalToLocalFraction(globalFraction, this._points.length - 1);
     }
     /** Return a frenet frame, using nearby points to estimate a plane. */
     fractionToFrenetFrame(fraction, result) {
@@ -189883,6 +190153,10 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
     numPoints() {
         return this._points.length;
     }
+    /** Return the number of edges in this linestring. */
+    numEdges() {
+        return this._points.length > 0 ? this._points.length - 1 : 0;
+    }
     /** Evaluate the end point of the linestring. */
     endPoint() {
         if (this._points.length === 0)
@@ -190468,9 +190742,9 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         return result;
     }
     /** Return (if possible) a specific segment of the linestring */
-    getIndexedSegment(index) {
+    getIndexedSegment(index, result) {
         if (index >= 0 && index + 1 < this._points.length)
-            return _LineSegment3d__WEBPACK_IMPORTED_MODULE_15__.LineSegment3d.create(this._points.getPoint3dAtCheckedPointIndex(index), this._points.getPoint3dAtCheckedPointIndex(index + 1));
+            return _LineSegment3d__WEBPACK_IMPORTED_MODULE_15__.LineSegment3d.create(this._points.getPoint3dAtCheckedPointIndex(index), this._points.getPoint3dAtCheckedPointIndex(index + 1), result);
         return undefined;
     }
     /** Returns true if first and last points are within metric tolerance. */
@@ -190580,6 +190854,26 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
     projectedParameterRange(ray, lowHigh) {
         return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_18__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
     }
+    /**
+     * Convert the segment detail to a linestring detail:
+     * * `detail.childDetail` is set to a clone of the input segment detail (optionally populating pre-allocated `child` object).
+     * * `childDetail.a` is set to `segmentIndex`.
+     * * `detail.fraction` is set to the global linestring parameter.
+     * * `detail.curve` is set to the parent linestring.
+     * @param detail segment location detail, converted in place
+     * @param segmentIndex index of segment in the linestring
+     * @param numSegment linestring segment count
+     * @param parent optional linestring primitive
+     * @param child optional pre-allocated detail to use to clone the child data
+     * @returns reference to input detail, with both linestring and segment data
+     */
+    static convertLocalToGlobalDetail(detail, segmentIndex, numSegment, parent, child) {
+        detail.childDetail = detail.clone(child);
+        detail.childDetail.a = segmentIndex;
+        detail.fraction = this.mapLocalToGlobalFraction(segmentIndex, detail.fraction, numSegment);
+        detail.curve = parent;
+        return detail;
+    }
 }
 LineString3d._workPointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
 LineString3d._workPointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
@@ -192174,10 +192468,10 @@ class PlanarSubdivision {
      *   * no action if start and end points are identical.
      * @param graph containing graph.
      * @param p the curve
-     * @param fraction0 starting fraction
      * @param point0 start point
-     * @param fraction1 end fraction
+     * @param fraction0 starting fraction
      * @param point1 end point
+     * @param fraction1 end fraction
      * @returns end point and fraction, or start point and fraction if no action
      */
     static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
@@ -194009,25 +194303,25 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "RegionGroupOpType": () => (/* binding */ RegionGroupOpType),
 /* harmony export */   "RegionOpsFaceToFaceSearch": () => (/* binding */ RegionOpsFaceToFaceSearch)
 /* harmony export */ });
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
 /* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
 /* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
 /* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
 /* harmony import */ var _topology_RegularizeFace__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../topology/RegularizeFace */ "../../core/geometry/lib/esm/topology/RegularizeFace.js");
-/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
-/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
-/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
 /* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
-/* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_17__ = __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 _Arc3d__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
 /* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
-/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
+/* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
+/* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
+/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -207085,7 +207379,7 @@ class GrowableXYArray extends _IndexedXYCollection__WEBPACK_IMPORTED_MODULE_0__.
                 this.pushXY(p.x, p.y);
         }
     }
-    /** Push points from variant sources.
+    /** Push copies of points from variant sources.
      * Valid inputs are:
      * * Point2d
      * * Point3d
@@ -207794,7 +208088,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         for (const p of points)
             this.push(p);
     }
-    /** Push points from variant sources.
+    /** Push copies of points from variant sources.
      * Valid inputs are:
      * * Point2d
      * * Point3d
@@ -208998,6 +209292,19 @@ class IndexedXYZCollection {
             return undefined;
         return this.getPoint3dAtUncheckedPointIndex(this.length - 1, result);
     }
+    /**
+     * Test whether the indexed points are equal within tolerance.
+     * @param index0 index of first point
+     * @param index1 index of second point
+     * @param tolerance max coordinate difference to be considered equal. For exact test, pass 0. Defaults to `Geometry.smallMetricDistance`.
+     */
+    almostEqualIndexIndex(index0, index1, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        if (index0 < 0 || index0 >= this.length || index1 < 0 || index1 >= this.length)
+            return undefined;
+        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getXAtUncheckedPointIndex(index0), this.getXAtUncheckedPointIndex(index1), tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getYAtUncheckedPointIndex(index0), this.getYAtUncheckedPointIndex(index1), tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getZAtUncheckedPointIndex(index0), this.getZAtUncheckedPointIndex(index1), tolerance);
+    }
 }
 /**
  * abstract base class extends IndexedXYZCollection, adding methods to push, peek, and pop, and rewrite.
@@ -216784,9 +217091,11 @@ __webpack_require__.r(__webpack_exports__);
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
 
 
-/* eslint-disable @typescript-eslint/naming-convention, no-empty */
 
 
 //
@@ -216978,12 +217287,13 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "IndexedXYZCollectionPolygonOps": () => (/* binding */ IndexedXYZCollectionPolygonOps),
 /* harmony export */   "Point3dArrayPolygonOps": () => (/* binding */ Point3dArrayPolygonOps),
 /* harmony export */   "PolygonLocationDetail": () => (/* binding */ PolygonLocationDetail),
+/* harmony export */   "PolygonLocationDetailPair": () => (/* binding */ PolygonLocationDetailPair),
 /* harmony export */   "PolygonOps": () => (/* binding */ PolygonOps)
 /* harmony export */ });
 /* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../geometry4d/Matrix4d */ "../../core/geometry/lib/esm/geometry4d/Matrix4d.js");
-/* harmony import */ var _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry4d/Point4d */ "../../core/geometry/lib/esm/geometry4d/Point4d.js");
+/* harmony import */ var _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry4d/Matrix4d */ "../../core/geometry/lib/esm/geometry4d/Matrix4d.js");
+/* harmony import */ var _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../geometry4d/Point4d */ "../../core/geometry/lib/esm/geometry4d/Point4d.js");
 /* harmony import */ var _topology_XYParitySearchContext__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../topology/XYParitySearchContext */ "../../core/geometry/lib/esm/topology/XYParitySearchContext.js");
 /* harmony import */ var _FrameBuilder__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
 /* harmony import */ var _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
@@ -216993,6 +217303,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _Point2dVector2d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
 /* harmony import */ var _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _PolylineOps__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./PolylineOps */ "../../core/geometry/lib/esm/geometry3d/PolylineOps.js");
 /* harmony import */ var _Ray3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
 /* harmony import */ var _SortablePolygon__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./SortablePolygon */ "../../core/geometry/lib/esm/geometry3d/SortablePolygon.js");
 /*---------------------------------------------------------------------------------------------
@@ -217017,6 +217328,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
  * Carries data about a point in the plane of a polygon.
  * @public
@@ -217070,6 +217382,51 @@ class PolygonLocationDetail {
             this.code === _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex || this.code === _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior ||
             this.code === _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToVertex || this.code === _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToEdgeInterior;
     }
+    /**
+     * Set point, index, and fraction for an "at vertex" or "along edge" PolygonLocationDetail.
+     * * Point is not captured; its coordinates are copied.
+     */
+    static createAtVertexOrEdge(point, index, fraction = 0) {
+        const detail = new PolygonLocationDetail();
+        detail.point.setFrom(point);
+        detail.closestEdgeIndex = index;
+        detail.closestEdgeParam = fraction;
+        fraction = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.clamp(fraction, 0, 1);
+        detail.code = (fraction > 0 && fraction < 1) ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex;
+        return detail;
+    }
+}
+/**
+ * A pair of PolygonLocationDetail.
+ * @public
+ */
+class PolygonLocationDetailPair {
+    /** Constructor, captures inputs */
+    constructor(detailA, detailB) {
+        this.detailA = detailA ? detailA : PolygonLocationDetail.create();
+        this.detailB = detailB ? detailB : PolygonLocationDetail.create();
+    }
+    /** Create an instance by capturing inputs */
+    static create(detailA, detailB, result) {
+        if (!result)
+            return new PolygonLocationDetailPair(detailA, detailB);
+        result.detailA = detailA;
+        result.detailB = detailB;
+        return result;
+    }
+    /** Make a deep copy of this PolygonLocationDetailPair */
+    clone(result) {
+        result = result ? result : new PolygonLocationDetailPair();
+        result.detailA.copyContentsFrom(this.detailA);
+        result.detailB.copyContentsFrom(this.detailB);
+        return result;
+    }
+    /** Swap the details of A, B */
+    swapDetails() {
+        const q = this.detailA;
+        this.detailA = this.detailB;
+        this.detailB = q;
+    }
 }
 /**
  * Carrier for a loop extracted from clip operation, annotated for sorting
@@ -217791,13 +218148,14 @@ class PolygonOps {
         return sortedLoopsArray;
     }
     /** Compute the closest point on the polygon boundary to the given point.
+     * * Compare to [[closestPoint]].
      * @param polygon points of the polygon, closure point optional
      * @param testPoint point p to project onto the polygon edges. Works best when p is in the plane of the polygon.
      * @param tolerance optional distance tolerance to determine point-vertex and point-edge coincidence.
      * @param result optional pre-allocated object to fill and return
      * @returns details d of the closest point `d.point`:
      * * `d.isValid()` returns true if and only if the polygon is nontrivial.
-     * * `d.edgeIndex` and `d.edgeParam` specify the location of the closest point, within `distTol`.
+     * * `d.edgeIndex` and `d.edgeParam` specify the location of the closest point.
      * * `d.code` classifies the closest point as a vertex (`PolygonLocation.OnPolygonVertex`) or as a point on an edge (`PolygonLocation.OnPolygonEdgeInterior`).
      * * `d.a` is the distance from testPoint to the closest point.
      * * `d.v` can be used to classify p (if p and polygon are coplanar): if n is the polygon normal then `d.v.dotProduct(n)` is +/-/0 if and only if p is inside/outside/on the polygon.
@@ -217850,7 +218208,7 @@ class PolygonOps {
                 }
                 if (distToStart2 < minDist2) {
                     if (polygon.dotProductIndexIndexXYAndZ(iBase, iPrev, testPoint) <= 0.0) {
-                        // update candidate (to edge start) only if previous edge was NOOP
+                        // update candidate (to edge start) only if testPoint projected beyond previous edge end
                         polygon.getPoint3dAtUncheckedPointIndex(iBase, result.point);
                         result.a = Math.sqrt(distToStart2);
                         polygon.crossProductIndexIndexIndex(iBase, iPrev, iNext, result.v);
@@ -217914,6 +218272,41 @@ class PolygonOps {
         }
         return result;
     }
+    /**
+     * Compute the closest point on the polygon boundary or its interior to the given point.
+     * * Compare to [[closestPointOnBoundary]].
+     * @param polygon points of the polygon, closure point optional
+     * @param testPoint point p to project onto the polygon edges. Works best when p is in the plane of the polygon.
+     * @param tolerance optional distance tolerance for distinguishing boundary versus interior closest point.
+     * @param result optional pre-allocated object to fill and return
+     * @returns details d of the closest point `d.point`:
+     * * `d.isValid()` returns true if and only if the polygon is nontrivial.
+     * * `d.edgeIndex` and `d.edgeParam` specify the location of the (nearest) boundary point.
+     * * `d.code` classifies the closest point: `PolygonLocation.OnPolygonVertex`, `PolygonLocation.OnPolygonEdgeInterior`, `PolygonLocation.InsidePolygonProjectsToVertex`, or `PolygonLocation.InsidePolygonProjectsToEdgeInterior`.
+     * * `d.a` is the distance from testPoint to the closest point.
+     */
+    static closestPoint(polygon, testPoint, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance, result) {
+        if (!(polygon instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_5__.IndexedXYZCollection))
+            return this.closestPoint(new _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_4__.Point3dArrayCarrier(polygon), testPoint, tolerance, result);
+        if (!this.unitNormal(polygon, this._normal))
+            return PolygonLocationDetail.create(result); // invalid
+        const polygonPlane = this._workPlane = _Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_11__.Plane3dByOriginAndUnitNormal.createXYZUVW(polygon.getXAtUncheckedPointIndex(0), polygon.getYAtUncheckedPointIndex(0), polygon.getZAtUncheckedPointIndex(0), this._normal.x, this._normal.y, this._normal.z, this._workPlane);
+        const planePoint = this._workXYZ = polygonPlane.projectPointToPlane(testPoint, this._workXYZ);
+        result = this.closestPointOnBoundary(polygon, planePoint, tolerance, result);
+        if (result.isValid) {
+            const dot = result.v.dotProduct(this._normal);
+            if (dot > 0.0) { // planePoint is inside, so return it instead of the closest boundary point
+                result.point.setFrom(planePoint);
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex === result.code)
+                    result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToVertex;
+                else if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior === result.code)
+                    result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToEdgeInterior;
+            }
+            result.a = testPoint.distance(result.point);
+            result.v.setZero(); // not relevant
+        }
+        return result;
+    }
     /** Compute the intersection of a line (parameterized as a ray) with the plane of this polygon.
      * @param polygon points of the polygon, closure point optional
      * @param ray infinite line to intersect, as a ray
@@ -217931,7 +218324,7 @@ class PolygonOps {
         if (!this.unitNormal(polygon, this._normal))
             return PolygonLocationDetail.create(result); // invalid
         this._workPlane = _Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_11__.Plane3dByOriginAndUnitNormal.createXYZUVW(polygon.getXAtUncheckedPointIndex(0), polygon.getYAtUncheckedPointIndex(0), polygon.getZAtUncheckedPointIndex(0), this._normal.x, this._normal.y, this._normal.z, this._workPlane);
-        const intersectionPoint = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero(this._workXYZ);
+        const intersectionPoint = this._workXYZ = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero(this._workXYZ);
         const rayParam = ray.intersectionWithPlane(this._workPlane, intersectionPoint);
         if (undefined === rayParam)
             return PolygonLocationDetail.create(result);
@@ -218104,15 +218497,80 @@ class PolygonOps {
             coords[i] *= scale; // normalized
         return coords;
     }
+    /**
+     * Force the polygon to be closed.
+     * * If first and last points are not within tolerance, push copy of first point
+     * * If first and last points are within tolerance, set last point equal to first
+     * @param polygon input polygon
+     * @param tolerance closure distance tolerance
+     */
+    static forceClosure(polygon, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
+        if (polygon.length >= 2) {
+            if (polygon instanceof _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__.GrowableXYZArray) {
+                polygon.forceClosure(tolerance);
+            }
+            else if (polygon[0].distance(polygon[polygon.length - 1]) > tolerance) {
+                polygon.push(polygon[0].clone());
+            }
+            else {
+                polygon[polygon.length - 1].setFromPoint3d(polygon[0]);
+            }
+        }
+    }
+    /**
+     * Return a closed polygon, cloning only if necessary.
+     * * If the first and last points are not identical, call [[forceClosure]] on a clone of the polygon and return it.
+     * * If the first and last points are already identical, just return the input.
+     * @param polygon input polygon
+     * @param tolerance closure distance tolerance
+     */
+    static ensureClosed(polygon, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
+        if (polygon.length >= 2) {
+            let forceClosure = false;
+            if (polygon instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_5__.IndexedXYZCollection)
+                forceClosure = !polygon.almostEqualIndexIndex(0, polygon.length - 1, 0.0);
+            else
+                forceClosure = !polygon[0].isExactEqual(polygon[polygon.length - 1]);
+            if (forceClosure) {
+                const cloned = _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__.GrowableXYZArray.create(polygon);
+                this.forceClosure(cloned, tolerance);
+                polygon = cloned;
+            }
+        }
+        return polygon;
+    }
+    /**
+     * Find smallest distance between polygons.
+     * * For efficiency, input polygons should include closure edge.
+     * * If searching interiors for close approaches, the polygons are assumed to be convex.
+     * @param polygonA first polygon
+     * @param polygonB second polygon
+     * @param dMax optional largest approach distance to consider
+     * @param _searchInterior If true, include (convex) polygon interiors in computations (currently unimplemented).
+     * If false (default): return closest approach between polygon boundaries only, using [[PolylineOps.closestApproach]].
+     * @return pair of details, one per polygon. The `a` field of each detail stores the closest approach distance.
+     */
+    static closestApproach(polygonA, polygonB, dMax = Number.MAX_VALUE, _searchInterior = false) {
+        // TODO: handle interior close approaches as well...
+        let result;
+        const polyA = this.ensureClosed(polygonA);
+        const polyB = this.ensureClosed(polygonB);
+        const cld = this._workCLDPair = _PolylineOps__WEBPACK_IMPORTED_MODULE_13__.PolylineOps.closestApproach(polyA, false, polyB, false, dMax, this._workCLDPair);
+        if (cld && cld.detailA.childDetail && cld.detailB.childDetail) {
+            result = PolygonLocationDetailPair.create(PolygonLocationDetail.createAtVertexOrEdge(cld.detailA.point, cld.detailA.childDetail.a, cld.detailA.childDetail.fraction), PolygonLocationDetail.createAtVertexOrEdge(cld.detailB.point, cld.detailB.childDetail.a, cld.detailB.childDetail.fraction));
+            result.detailA.a = result.detailB.a = cld.detailA.a;
+        }
+        return result;
+    }
 }
 /** These values are the integrated area moment products [xx,xy,xz, x]
  * for a right triangle in the first quadrant at the origin -- (0,0),(1,0),(0,1)
  */
-PolygonOps._triangleMomentWeights = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__.Matrix4d.createRowValues(2.0 / 24.0, 1.0 / 24.0, 0, 4.0 / 24.0, 1.0 / 24.0, 2.0 / 24.0, 0, 4.0 / 24.0, 0, 0, 0, 0, 4.0 / 24.0, 4.0 / 24.0, 0, 12.0 / 24.0);
+PolygonOps._triangleMomentWeights = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__.Matrix4d.createRowValues(2.0 / 24.0, 1.0 / 24.0, 0, 4.0 / 24.0, 1.0 / 24.0, 2.0 / 24.0, 0, 4.0 / 24.0, 0, 0, 0, 0, 4.0 / 24.0, 4.0 / 24.0, 0, 12.0 / 24.0);
 /** These values are the integrated volume moment products [xx,xy,xz, x, yx,yy,yz,y, zx,zy,zz,z,x,y,z,1]
  * for a tetrahedron in the first quadrant at the origin -- (0,00),(1,0,0),(0,1,0),(0,0,1)
  */
-PolygonOps._tetrahedralMomentWeights = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__.Matrix4d.createRowValues(1.0 / 60.0, 1.0 / 120, 1.0 / 120, 1.0 / 24.0, 1.0 / 120, 1.0 / 60.0, 1.0 / 120, 1.0 / 24.0, 1.0 / 120, 1.0 / 120, 1.0 / 60.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 6.0);
+PolygonOps._tetrahedralMomentWeights = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__.Matrix4d.createRowValues(1.0 / 60.0, 1.0 / 120, 1.0 / 120, 1.0 / 24.0, 1.0 / 120, 1.0 / 60.0, 1.0 / 120, 1.0 / 24.0, 1.0 / 120, 1.0 / 120, 1.0 / 60.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 24.0, 1.0 / 6.0);
 // statics for shared reuse.
 // many methods use these.
 // only use them in "leaf" methods that are certain not to call other users . . .
@@ -218121,9 +218579,9 @@ PolygonOps._vector1 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.cre
 PolygonOps._vector2 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
 PolygonOps._vectorOrigin = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
 PolygonOps._normal = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
-PolygonOps._matrixA = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__.Matrix4d.createIdentity();
-PolygonOps._matrixB = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__.Matrix4d.createIdentity();
-PolygonOps._matrixC = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_13__.Matrix4d.createIdentity();
+PolygonOps._matrixA = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__.Matrix4d.createIdentity();
+PolygonOps._matrixB = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__.Matrix4d.createIdentity();
+PolygonOps._matrixC = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_14__.Matrix4d.createIdentity();
 
 /**
  *  `IndexedXYZCollectionPolygonOps` class contains _static_ methods for typical operations on polygons carried as `IndexedXYZCollection`
@@ -218358,7 +218816,7 @@ class IndexedXYZCollectionPolygonOps {
         if (range.isNull)
             return undefined;
         const work = new _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__.GrowableXYZArray();
-        const plane = _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_14__.Point4d.create();
+        const plane = _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_15__.Point4d.create();
         plane.set(0, 0, -1, range.high.z);
         this.clipConvexPolygonInPlace(plane, xyz, work, true);
         if (xyz.length === 0)
@@ -218777,9 +219235,13 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "PolylineOps": () => (/* binding */ PolylineOps)
 /* harmony export */ });
+/* harmony import */ var _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
+/* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
 /* harmony import */ var _Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Plane3dByOriginAndUnitNormal */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js");
+/* harmony import */ var _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./PolylineCompressionByEdgeOffset */ "../../core/geometry/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js");
 /* harmony import */ var _Range__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
@@ -218796,6 +219258,10 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
+
+
+
 // cspell:word Puecker
 /**
  * PolylineOps is a collection of static methods operating on polylines.
@@ -218978,7 +219444,7 @@ class PolylineOps {
         }
     }
     /**
-     * Remove closure points a polyline or array of polylines
+     * Remove closure points of a polyline or array of polylines
      * @param data points.
      */
     static removeClosurePoint(data) {
@@ -219049,6 +219515,74 @@ class PolylineOps {
         }
         return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;
     }
+    /**
+     * Find smallest distance between polylines.
+     * * For polylines with many points, it is more efficient to use [[LineString3dRangeTreeContext.searchForClosestApproach]].
+     * @param pointsA first polyline
+     * @param extendA how to extend polylineA forward/backward
+     * @param pointsB second polyline
+     * @param extendB how to extend polylineB forward/backward
+     * @param dMax largest approach distance to consider
+     * @param result optional pre-allocated object to populate and return
+     * @returns pair of details, one for each polyline, with field values:
+     * * `a` is the closest approach distance
+     * * `point` is the point of closest approach
+     * * `fraction` is the global polyline fraction
+     * * `childDetail.a` is the segment index
+     * * `childDetail.fraction` is the local segment fraction
+     */
+    static closestApproach(pointsA, extendA, pointsB, extendB, dMax = Number.MAX_VALUE, result) {
+        if (Array.isArray(pointsA))
+            pointsA = new _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_6__.Point3dArrayCarrier(pointsA);
+        if (Array.isArray(pointsB))
+            pointsB = new _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_6__.Point3dArrayCarrier(pointsB);
+        let dMin = dMax;
+        let foundMin = false;
+        const numSegmentA = pointsA.length - 1;
+        const numSegmentB = pointsB.length - 1;
+        const extendSegA = [_curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendMode.None, _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendMode.None];
+        const extendSegB = [_curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendMode.None, _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendMode.None];
+        // lambda to set extension for first and last segment of a polyline
+        const convertExtend = (extendOut, extendIn, segmentIndex, numSegments) => {
+            extendOut[0] = extendOut[1] = _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendMode.None;
+            if (segmentIndex === 0)
+                extendOut[0] = _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 0);
+            else if (segmentIndex === numSegments - 1)
+                extendOut[1] = _curve_CurveExtendMode__WEBPACK_IMPORTED_MODULE_7__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 1);
+        };
+        // lambda to extract LineSegment3d from polyline
+        const fillSegment = (points, index, segment) => {
+            if (segment === undefined)
+                return _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_8__.LineSegment3d.createCapture(points.getPoint3dAtUncheckedPointIndex(index), points.getPoint3dAtUncheckedPointIndex(index + 1));
+            points.getPoint3dAtUncheckedPointIndex(index, segment.point0Ref);
+            points.getPoint3dAtUncheckedPointIndex(index + 1, segment.point1Ref);
+            return segment;
+        };
+        // just test the segments
+        for (let indexA = 0; indexA < numSegmentA; indexA++) {
+            this._workSegmentA = fillSegment(pointsA, indexA, this._workSegmentA);
+            convertExtend(extendSegA, extendA, indexA, numSegmentA);
+            for (let indexB = 0; indexB < numSegmentB; indexB++) {
+                this._workSegmentB = fillSegment(pointsB, indexB, this._workSegmentB);
+                convertExtend(extendSegB, extendB, indexB, numSegmentB);
+                if (undefined !== (this._workLocalDetailPair = _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_8__.LineSegment3d.closestApproach(this._workSegmentA, extendSegA, this._workSegmentB, extendSegB, this._workLocalDetailPair))) {
+                    const d = this._workLocalDetailPair.detailA.a;
+                    if (d < dMin) {
+                        const childDetailA = result?.detailA.childDetail; // save and reuse
+                        const childDetailB = result?.detailB.childDetail;
+                        result = this._workLocalDetailPair.clone(result); // overwrite previous result
+                        _curve_LineString3d__WEBPACK_IMPORTED_MODULE_9__.LineString3d.convertLocalToGlobalDetail(result.detailA, indexA, numSegmentA, undefined, childDetailA);
+                        _curve_LineString3d__WEBPACK_IMPORTED_MODULE_9__.LineString3d.convertLocalToGlobalDetail(result.detailB, indexB, numSegmentB, undefined, childDetailB);
+                        if (result.detailA.childDetail && result.detailB.childDetail)
+                            result.detailA.childDetail.curve = result.detailB.childDetail.curve = undefined; // no CurvePrimitives survive in output
+                        dMin = d;
+                        foundMin = true;
+                    }
+                }
+            }
+        }
+        return foundMin ? result : undefined;
+    }
 }
 
 
@@ -222110,7 +222644,7 @@ class Transform {
      * @param other Transform to compare to.
      */
     isAlmostEqual(other) {
-        return this.origin.isAlmostEqual(other.origin) && this.matrix.isAlmostEqual(other.matrix);
+        return this === other || this.origin.isAlmostEqual(other.origin) && this.matrix.isAlmostEqual(other.matrix);
     }
     /**
      * Test for near equality with `other` Transform. Comparison uses the `isAlmostEqual` methods on the `origin` part
@@ -229625,8 +230159,20 @@ class SmallSystem {
         return this.ray3dXYZUVWClosestApproachUnbounded(a0.x, a0.y, a0.z, a1.x - a0.x, a1.y - a0.y, a1.z - a0.z, b0.x, b0.y, b0.z, b1.x - b0.x, b1.y - b0.y, b1.z - b0.z, result);
     }
     /**
-     * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d
+     * Return true if the given rays have closest approach (go by each other) in 3d
      * Return the fractional (not xy) coordinates as x and y parts of a Point2d.
+     * @param ax x-coordinate of the origin of the first ray
+     * @param ay y-coordinate of the origin of the first ray
+     * @param az z-coordinate of the origin of the first ray
+     * @param au x-coordinate of the direction vector of the first ray
+     * @param av y-coordinate of the direction vector of the first ray
+     * @param aw z-coordinate of the direction vector of the first ray
+     * @param bx x-coordinate of the origin of the second ray
+     * @param by y-coordinate of the origin of the second ray
+     * @param bz z-coordinate of the origin of the second ray
+     * @param bu x-coordinate of the direction vector of the second ray
+     * @param bv y-coordinate of the direction vector of the second ray
+     * @param bw z-coordinate of the direction vector of the second ray
      * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
      */
     static ray3dXYZUVWClosestApproachUnbounded(ax, ay, az, au, av, aw, bx, by, bz, bu, bv, bw, result) {
@@ -231598,6 +232144,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "ConvexFacetLocationDetail": () => (/* binding */ ConvexFacetLocationDetail),
 /* harmony export */   "FacetIntersectOptions": () => (/* binding */ FacetIntersectOptions),
+/* harmony export */   "FacetLocationDetailPair": () => (/* binding */ FacetLocationDetailPair),
 /* harmony export */   "NonConvexFacetLocationDetail": () => (/* binding */ NonConvexFacetLocationDetail),
 /* harmony export */   "TriangularFacetLocationDetail": () => (/* binding */ TriangularFacetLocationDetail)
 /* harmony export */ });
@@ -231631,6 +232178,21 @@ class FacetIntersectOptions {
         this.parameterTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFraction;
     }
 }
+/**
+ * A pair of FacetLocationDetail.
+ * @public
+ */
+class FacetLocationDetailPair {
+    /** Constructor, captures inputs */
+    constructor(detailA, detailB) {
+        this.detailA = detailA;
+        this.detailB = detailB;
+    }
+    /** Create a facet detail pair, capturing inputs. */
+    static create(detailA, detailB) {
+        return new FacetLocationDetailPair(detailA, detailB);
+    }
+}
 /**
  * Implementation of `FacetLocationDetail` for a triangular facet.
  * @public
@@ -231651,17 +232213,23 @@ class TriangularFacetLocationDetail {
         this._color = undefined;
     }
     /** Create a detail.
+     * @param detail optional, copied if given
      * @param result optional pre-allocated object to fill and return
      */
-    static create(facetIndex, detail, result) {
-        if (undefined === result)
-            return new TriangularFacetLocationDetail(facetIndex, detail);
-        result.invalidate(false); // detail might be owned by result!
+    static create(facetIndex = -1, detail, result) {
+        if (!result)
+            result = new TriangularFacetLocationDetail();
+        else
+            result.invalidate(false); // shallow: detail might be owned by result!
         result._facetIndex = facetIndex;
-        if (undefined !== detail)
+        if (undefined !== detail && result._detail !== detail)
             result._detail.copyContentsFrom(detail);
         return result;
     }
+    /** Create a detail, capturing inputs. */
+    static createCapture(facetIndex, detail) {
+        return new TriangularFacetLocationDetail(facetIndex, detail);
+    }
     /** Get the facet index. */
     get facetIndex() {
         return this._facetIndex;
@@ -231762,7 +232330,7 @@ class TriangularFacetLocationDetail {
     }
 }
 /**
- * Implementation of `FacetLocationDetail` for a non-convex facet.
+ * Implementation of `FacetLocationDetail` for a general facet, which may or may not be convex.
  * * Facet vertex data interpolation is not available.
  * @public
  */
@@ -231781,18 +232349,24 @@ class NonConvexFacetLocationDetail {
             this._detail.invalidate();
     }
     /** Create a detail.
+     * @param detail optional, copied if given
      * @param result optional pre-allocated object to fill and return
      */
-    static create(facetIndex, edgeCount, detail, result) {
-        if (undefined === result)
-            return new NonConvexFacetLocationDetail(facetIndex, edgeCount, detail);
-        result.invalidate(false); // detail might be owned by result!
+    static create(facetIndex = -1, edgeCount = 0, detail, result) {
+        if (!result)
+            result = new NonConvexFacetLocationDetail();
+        else
+            result.invalidate(false); // shallow: detail might be owned by result!
         result._facetIndex = facetIndex;
         result._edgeCount = edgeCount;
         if (undefined !== detail && result._detail !== detail)
             result._detail.copyContentsFrom(detail);
         return result;
     }
+    /** Create a detail, capturing inputs. */
+    static createCapture(facetIndex, edgeCount, detail) {
+        return new NonConvexFacetLocationDetail(facetIndex, edgeCount, detail);
+    }
     /** Get the facet index. */
     get facetIndex() {
         return this._facetIndex;
@@ -231821,7 +232395,7 @@ class NonConvexFacetLocationDetail {
     get isValid() {
         return this._isValid && this._detail.isValid;
     }
-    /** Whether the facet is convex. */
+    /** Whether the facet is convex. Always returns false, as convexity is unknown to this detail. */
     get isConvex() {
         return false;
     }
@@ -231891,13 +232465,20 @@ class ConvexFacetLocationDetail extends NonConvexFacetLocationDetail {
         this._barycentricCoordinates = undefined;
     }
     /** Create a detail.
+     * @param detail optional, copied if given
      * @param result optional pre-allocated object to fill and return
      */
-    static create(facetIndex, edgeCount, detail, result) {
-        if (undefined === result)
-            return new ConvexFacetLocationDetail(facetIndex, edgeCount, detail);
+    static create(facetIndex = -1, edgeCount = 0, detail, result) {
+        if (!result)
+            result = new ConvexFacetLocationDetail();
+        else
+            result.invalidate(false); // shallow: detail might be owned by result!
         return super.create(facetIndex, edgeCount, detail, result);
     }
+    /** Create a detail, capturing inputs. */
+    static createCapture(facetIndex, edgeCount, detail) {
+        return new ConvexFacetLocationDetail(facetIndex, edgeCount, detail);
+    }
     /** Whether the facet is convex. */
     get isConvex() {
         return true;
@@ -236940,6 +237521,22 @@ class PolyfaceQuery {
         const inertiaProducts = PolyfaceQuery.sumFacetSecondVolumeMomentProducts(source, origin);
         return _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_8__.MomentData.inertiaProductsToPrincipalAxes(origin, inertiaProducts);
     }
+    /** Determine whether all facets are convex.
+     * @param source mesh to examine
+     */
+    static areFacetsConvex(source) {
+        if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_6__.Polyface)
+            return this.areFacetsConvex(source.createVisitor(0));
+        source.setNumWrap(0);
+        source.reset();
+        while (source.moveToNextFacet()) {
+            if (source.pointCount > 3) {
+                if (!_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_7__.PolygonOps.isConvex(source.point))
+                    return false;
+            }
+        }
+        return true;
+    }
     /**
      * Test for convex volume by dihedral angle tests on all edges.
      * * This tests if all dihedral angles are positive.
@@ -237547,6 +238144,8 @@ class PolyfaceQuery {
      * If not a polyface, visit all facets to find the largest index.
      */
     static visitorClientPointCount(visitor) {
+        if (visitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_6__.Polyface)
+            return visitor.data.point.length;
         const polyface = visitor.clientPolyface();
         if (polyface !== undefined)
             return polyface.data.point.length;
@@ -237563,6 +238162,11 @@ class PolyfaceQuery {
      * If not a polyface, visit all facets to accumulate a count.
      */
     static visitorClientFacetCount(visitor) {
+        if (visitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_6__.Polyface) {
+            if (visitor.facetCount !== undefined)
+                return visitor.facetCount;
+            visitor = visitor.createVisitor(0);
+        }
         const polyface = visitor.clientPolyface();
         if (polyface !== undefined && polyface.facetCount !== undefined)
             return polyface.facetCount;
@@ -238338,6 +238942,1307 @@ class RangeLengthData {
 }
 
 
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js":
+/*!**************************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js ***!
+  \**************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "LineString3dRangeTreeContext": () => (/* binding */ LineString3dRangeTreeContext)
+/* harmony export */ });
+/* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _RangeTreeNode__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./RangeTreeNode */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js");
+/* harmony import */ var _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./RangeTreeSearchHandlers */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+
+
+
+
+
+/**
+ * Handler class for searching a range tree containing the segments of a linestring.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+class LineString3dRangeTreeContext {
+    /** Constructor: capture inputs, initialize debug counters */
+    constructor(rangeTreeRoot, points) {
+        this.lineString = points;
+        this._rangeTreeRoot = rangeTreeRoot;
+        this.numRangeTestTrue = 0;
+        this.numRangeTestFalse = 0;
+        this.numPointTest = 0;
+        this.numSearch = 0;
+    }
+    /**
+     * Create a range tree context for the polyline points:
+     * * initialize with segment ranges
+     * * appData are segment indices
+     * @param linestring captured if LineString3d, otherwise copied
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)
+     */
+    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
+        const linestring = points instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_0__.LineString3d ? points : _curve_LineString3d__WEBPACK_IMPORTED_MODULE_0__.LineString3d.createPoints(points);
+        const rangeTreeRoot = _RangeTreeNode__WEBPACK_IMPORTED_MODULE_1__.RangeTreeOps.createByIndexSplits(((index) => { return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__.Range3d.create(linestring.pointAt(index), linestring.pointAt(index + 1)); }), ((index) => { return index; }), linestring.numPoints() - 1, // number of segments
+        maxChildPerNode, maxAppDataPerLeaf);
+        return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;
+    }
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
+     */
+    searchForClosestPoint(spacePoint, maxDist) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__.SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);
+        this.numSearch++;
+        // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.
+        const numTest = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);
+        const testStep = Math.floor(this.lineString.numPoints() / numTest);
+        handler.processAppData(0);
+        handler.processAppData(this.lineString.numPoints() - 2);
+        for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)
+            handler.processAppData(i);
+        this._rangeTreeRoot.searchTopDown(handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+    /**
+     * Search the range trees for closest approach(es) between the polylines.
+     * @param contextA first polyline context
+     * @param contextB second polyline context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance
+    */
+    static searchForClosestApproach(contextA, contextB, maxDist) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__.TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);
+        _RangeTreeNode__WEBPACK_IMPORTED_MODULE_1__.RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+}
+
+
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/MinimumValueTester.js":
+/*!****************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/MinimumValueTester.js ***!
+  \****************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "MinimumValueTester": () => (/* binding */ MinimumValueTester)
+/* harmony export */ });
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+/**
+ * Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.
+ * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.
+ * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.
+ * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.
+ * @internal
+ */
+class MinimumValueTester {
+    /**
+     * Capture the given item with undefined item and value, and optional maxValueForSavingToArray.
+     */
+    constructor(maxValueForSavingToArray) {
+        this.savedItems = [];
+        this.savedValues = [];
+        this.resetMinValueAndItem(undefined, undefined);
+        this.resetTriggerValueForSavingToArray(maxValueForSavingToArray, false);
+    }
+    /**
+     * Static method to create a tester.
+     * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.
+     * @returns new tester.
+     */
+    static create(maxValueForSavingToArray) {
+        return new MinimumValueTester(maxValueForSavingToArray);
+    }
+    /**
+     * Install new minimum value and associated item, both possibly undefined.
+     * * The existing arrays of saved items and values, and the trigger value, are unaffected.
+     * @param item object to associate with the new minimum value
+     * @param value new minimum value
+     */
+    resetMinValueAndItem(item = undefined, value = undefined) {
+        this.itemAtMinValue = item;
+        this.minValue = value;
+    }
+    /**
+     * Set the trigger value.
+     * @param value new trigger value
+     * @param reinitializeArrays whether to clear the arrays of saved items and values
+     */
+    resetTriggerValueForSavingToArray(value, reinitializeArrays = false) {
+        this.triggerForSavingToArray = value;
+        if (reinitializeArrays) {
+            this.savedItems = [];
+            this.savedValues = [];
+        }
+    }
+    /**
+     * Test a new item with value.
+     * * Push the new item and value to the saved arrays if both:
+     *   * `this.triggerForSavingToArray` is defined
+     *   * the new value is less than or equal to `this.triggerForSavingToArray`.
+     * * Save the new item and value if either:
+     *   * `this.minValue` is undefined
+     *   * new value is less than `this.minValue`.
+     * @param item item to be saved (captured!) if value conditions are met
+     * @param value numeric value being minimized.
+     * @returns true if and only if the input value is the new minimum value.
+     */
+    testAndSave(item, value) {
+        if (this.doesValueTrigger(value)) {
+            this.savedValues.push(value);
+            this.savedItems.push(item);
+        }
+        if (this.isNewMinValue(value)) {
+            this.minValue = value;
+            this.itemAtMinValue = item;
+            return true;
+        }
+        return false;
+    }
+    /** Whether the input value is small enough to be saved to this instance. */
+    doesValueTrigger(value) {
+        return this.triggerForSavingToArray !== undefined && value <= this.triggerForSavingToArray;
+    }
+    /** Whether the input value is smaller than the last recorded minimum value. */
+    isNewMinValue(value) {
+        return this.minValue === undefined || value < this.minValue;
+    }
+    /** Whether the input value is small enough to be the new minimum or to be saved to this instance. */
+    isNewMinOrTrigger(value) {
+        return this.isNewMinValue(value) || this.doesValueTrigger(value);
+    }
+}
+
+
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js":
+/*!**************************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js ***!
+  \**************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "Point3dArrayRangeTreeContext": () => (/* binding */ Point3dArrayRangeTreeContext)
+/* harmony export */ });
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./RangeTreeNode */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js");
+/* harmony import */ var _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./RangeTreeSearchHandlers */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+
+
+
+/**
+ * Handler class for searching a range tree containing unordered Point3d data.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+class Point3dArrayRangeTreeContext {
+    /** Constructor: capture inputs, initialize debug counters */
+    constructor(rangeTreeRoot, points) {
+        this.points = points;
+        this._rangeTreeRoot = rangeTreeRoot;
+        this.numRangeTestTrue = 0;
+        this.numRangeTestFalse = 0;
+        this.numPointTest = 0;
+        this.numSearch = 0;
+    }
+    /**
+     * Create a range tree context with given points:
+     * * initialize with single-point ranges
+     * * appData are point indices
+     * @param points captured
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)
+     */
+    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
+        const rangeTreeRoot = _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.RangeTreeOps.createByIndexSplits(((index) => { return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.create(points[index]); }), ((index) => { return index; }), points.length, maxChildPerNode, maxAppDataPerLeaf);
+        return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points) : undefined;
+    }
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with following fields set:
+     * * detail.point = the closest point
+     * * detail.fraction = the index of the closest point in the points array
+     * * detail.a = distance from spacePoint to closest point
+     */
+    searchForClosestPoint(spacePoint, maxDist) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_2__.SingleTreeSearchHandlerForClosestPointInArray(spacePoint, this, maxDist);
+        this.numSearch++;
+        this._rangeTreeRoot.searchTopDown(handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+    /**
+     * Search the range trees for closest approach(es) between the point arrays.
+     * @param contextA first point array context
+     * @param contextB second point array context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, each with the following fields set:
+     * * detail.point = the point at closest approach
+     * * detail.fraction = the index of detail.point in the points array
+     * * detail.a = the closest approach distance
+    */
+    static searchForClosestApproach(contextA, contextB, maxDist) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_2__.TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach(contextA, contextB, maxDist);
+        _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+}
+
+
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js":
+/*!**********************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js ***!
+  \**********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "PolyfaceRangeTreeContext": () => (/* binding */ PolyfaceRangeTreeContext)
+/* harmony export */ });
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
+/* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
+/* harmony import */ var _RangeTreeNode__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./RangeTreeNode */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js");
+/* harmony import */ var _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./RangeTreeSearchHandlers */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+
+
+
+
+
+/**
+ * Handler class for searching a range tree containing the facets of a polyface.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+class PolyfaceRangeTreeContext {
+    /** Constructor: capture inputs, initialize debug counters */
+    constructor(rangeTreeRoot, visitor, convexFacets = false) {
+        this.visitor = visitor;
+        this.convexFacets = convexFacets;
+        this._rangeTreeRoot = rangeTreeRoot;
+        this.numRangeTestTrue = 0;
+        this.numRangeTestFalse = 0;
+        this.numFacetTest = 0;
+        this.numSearch = 0;
+    }
+    /**
+     * Create a range tree context for the Polyface facets.
+     * * This is a very simple construction that splits "right and left parts" of the facet sequence.
+     * * Facets with any recognizable "left to right" or "top to bottom" sequencing will have very effective search structures.
+     * @param visitor access to facets, captured if PolyfaceVisitor
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum facet indices per leaf node (default 4)
+     * @param convexFacets whether all facets are known to be convex (cf. [[PolyfaceQuery.areFacetsConvex]]) (default false)
+     */
+    static createCapture(visitor, maxChildPerNode = 4, maxAppDataPerLeaf = 4, convexFacets = false) {
+        if (visitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_0__.Polyface)
+            return this.createCapture(visitor.createVisitor(0), maxChildPerNode, maxAppDataPerLeaf, convexFacets);
+        const numFacet = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_1__.PolyfaceQuery.visitorClientFacetCount(visitor);
+        const rangeTreeRoot = _RangeTreeNode__WEBPACK_IMPORTED_MODULE_2__.RangeTreeOps.createByIndexSplits((index) => { visitor.moveToReadIndex(index); return visitor.range(); }, (index) => { return index; }, numFacet, maxChildPerNode, maxAppDataPerLeaf);
+        return rangeTreeRoot ? new PolyfaceRangeTreeContext(rangeTreeRoot, visitor, convexFacets) : undefined;
+    }
+    /**
+     * Search the range tree for closest facet(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.
+     * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
+     */
+    searchForClosestPoint(spacePoint, maxDist, searchFacetInterior = false) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__.SingleTreeSearchHandlerForClosestPointOnPolyface(spacePoint, this, maxDist, searchFacetInterior);
+        this.numSearch++;
+        const numFacet = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_1__.PolyfaceQuery.visitorClientFacetCount(this.visitor);
+        // seed the search with a few points -- this reduces early trips deep into early ranges that are far from spacePoint.
+        const numTest = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.clamp(Math.floor(numFacet / 20), 2, 7);
+        const testStep = Math.floor(numFacet / numTest);
+        handler.processAppData(0);
+        handler.processAppData(numFacet - 1);
+        for (let i = testStep; i + 1 < numFacet; i += testStep)
+            handler.processAppData(i);
+        this._rangeTreeRoot.searchTopDown(handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+    /**
+     * Search the range trees for closest approach(es) between the polyfaces.
+     * @param contextA first polyface context
+     * @param contextB second polyface context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @param searchFacetInterior whether to include facet interiors in search (`context.convexFacets` must be true for both contexts). Default is false: just consider facet boundaries.
+     * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance
+    */
+    static searchForClosestApproach(contextA, contextB, maxDist, searchFacetInterior = false) {
+        const handler = new _RangeTreeSearchHandlers__WEBPACK_IMPORTED_MODULE_3__.TwoTreeSearchHandlerForFacetFacetCloseApproach(contextA, contextB, maxDist, searchFacetInterior);
+        _RangeTreeNode__WEBPACK_IMPORTED_MODULE_2__.RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+}
+
+
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js":
+/*!***********************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js ***!
+  \***********************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "RangeTreeNode": () => (/* binding */ RangeTreeNode),
+/* harmony export */   "RangeTreeOps": () => (/* binding */ RangeTreeOps),
+/* harmony export */   "SingleTreeSearchHandler": () => (/* binding */ SingleTreeSearchHandler),
+/* harmony export */   "TwoTreeDistanceMinimizationSearchHandler": () => (/* binding */ TwoTreeDistanceMinimizationSearchHandler),
+/* harmony export */   "TwoTreeSearchHandler": () => (/* binding */ TwoTreeSearchHandler)
+/* harmony export */ });
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+
+
+/**
+ * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:
+ * * an array of type T
+ * * a function which takes an index and returns type T
+ * @internal
+ */
+function evaluateIndexToType(data, index) {
+    if (Array.isArray(data))
+        return data[index];
+    return data(index);
+}
+/**
+ * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.
+ * @internal
+ */
+function getByIndex(index, data) {
+    if (data !== undefined) {
+        if (Array.isArray(data)) {
+            if (index < data.length)
+                return data[index];
+        }
+        else {
+            return data;
+        }
+    }
+    return undefined;
+}
+/**
+ * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.
+ * @internal
+ */
+function getFlexDataCount(data) {
+    if (data !== undefined) {
+        if (Array.isArray(data)) {
+            return data.length;
+        }
+        else {
+            return 1;
+        }
+    }
+    return 0;
+}
+/**
+ * Abstract class for handler objects called during traversal of a single range tree.
+ * @internal
+ */
+class SingleTreeSearchHandler {
+    /**
+     * Query to see if the active search has been aborted.
+     * * Default implementation returns false so query runs to completion.
+     * * Search processes check this after range tests and child processing.
+     */
+    // eslint-disable-next-line @itwin/prefer-get
+    isAborted() { return false; }
+}
+/**
+ * Abstract class for handler objects called during traversal of two range trees.
+ * @internal
+ */
+class TwoTreeSearchHandler {
+    /**
+     * Query to see if the active search has been aborted.
+     * * Default implementation returns false so query runs to completion.
+     * * Search processes check this after range tests and child processing.
+     */
+    // eslint-disable-next-line @itwin/prefer-get
+    isAborted() { return false; }
+}
+/**
+ * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.
+ * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.
+ * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.
+ * @internal
+ */
+class TwoTreeDistanceMinimizationSearchHandler extends TwoTreeSearchHandler {
+    /**
+     * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.
+     * @param leftRange range from a node in the left tree
+     * @param rightRange range from a node in the right tree.
+     * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()
+     */
+    isRangePairActive(leftRange, rightRange) {
+        const currentDistance = this.getCurrentDistance();
+        const distanceBetweenRanges = leftRange.distanceToRange(rightRange);
+        if (distanceBetweenRanges <= currentDistance) {
+            return true;
+        }
+        return false;
+    }
+}
+let numNodeCreated = 0;
+/**
+ * * TREE STRUCTURE
+ *   * A RangeTreeNode is part of a range tree.
+ *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.
+ *   * Each RangeNode points to 0, 1 or many children.
+ *   * Each child has (but does not point back to) a single parent.
+ *   * The overall tree has a single root.
+ *   * Each node is effectively the root of the tree of its children.
+ * * NON-TREE DATA MEMBERS
+ *   * Data members in each node (in addition to children) are
+ *     * _range = the union of ranges below in the heap
+ *     * _appData = application data associated with the node.
+ *       * Construction methods may place multiple _appData items in each node.
+ * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
+ * * CONSTRUCTION
+ *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.
+ *     * The appData is placed entirely in the leaves.
+ *     * caller can specify:
+ *       * the number of _appData items per leaf
+ *       * the number of children per node within the tree.
+ *     * "deep" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)
+ *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.
+ *       * larger memory use because of more nodes
+ *   * For future construction methods:
+ *      * _appData "above the leaves" may allow nodes below to have smaller ranges, but add complexity to search.
+ * @internal
+ */
+class RangeTreeNode {
+    /**
+     * CONSTRUCTOR
+     * CAPTURE (not copy)
+     * * range = range for search algorithms
+     * * appData = application data relevant to this node.
+     * * children = child node reference(s).
+     */
+    constructor(range, appData, children) {
+        this._range = range;
+        this._appData = appData;
+        this._children = children;
+        this._id = numNodeCreated++;
+        // const childIds: number[] = [];
+        // if (Array.isArray(this._children))
+        //   for (const c of this._children) childIds.push(c._id);
+        // else if (this._children instanceof RangeTreeNode)
+        //   childIds.push(this._children._id);
+        // const numAppData = getFlexDataCount(appData);
+        // console.log({ id: this._id, childIds, numAppData });
+    }
+    /** Simplest public create: capture the range, appData, and children. */
+    static createCapture(range, appData, children) {
+        return new RangeTreeNode(range, appData, children);
+    }
+    /** copy (not capture) from given data into the range in this RangeEntry */
+    setRange(data) {
+        this._range.setFrom(data);
+    }
+    /** return (a copy of) the range in this RangeEntry */
+    getRange(data) {
+        return this._range.clone(data);
+    }
+    /** return (a reference to) the range in this RangeEntry */
+    getRangeRef() {
+        return this._range;
+    }
+    /**
+     * Access a child by index.
+     * * If the child data is an array, this dereferences the array.
+     * * If the child data is a singleton, treat it as index 0.
+     * * return undefined if there are no children.
+     * @param index index of item to access.
+     */
+    getChildByIndex(index) {
+        return getByIndex(index, this._children);
+    }
+    /**
+     * * Access an appData by index.
+     * * If the appData data is an array, this dereferences the array.
+     * * If the appData data is a singleton, treat it as if it is at index 0 in an array
+     * * return undefined if there are no appData or for any index out of range.
+     * @param index index of item to access.
+     */
+    getAppDataByIndex(index) {
+        return getByIndex(index, this._appData);
+    }
+    /** Access the children or child (does not clone). */
+    getAllChildren() {
+        return this._children;
+    }
+    /** Access the appData array or singleton (does not clone). */
+    getAllAppData() {
+        return this._appData;
+    }
+    /**
+     * Count the direct children in this node of the tree.
+     * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.
+     */
+    getNumChildren() {
+        return getFlexDataCount(this._children);
+    }
+    /**
+     * Count the appData items in this node of the tree.
+     * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.
+     */
+    getNumAppData() {
+        return getFlexDataCount(this._appData);
+    }
+    /**
+     * Depth-first tree iteration, calling `announceNode` on each node.
+     * @param announceNode callback that returns true to recurse into children
+     */
+    recurseIntoTree(announceNode) {
+        const doChildren = announceNode(this);
+        if (doChildren) {
+            if (Array.isArray(this._children)) {
+                for (const child of this._children)
+                    child.recurseIntoTree(announceNode);
+            }
+            else if (this._children !== undefined) {
+                this._children.recurseIntoTree(announceNode);
+            }
+        }
+    }
+    /**
+     * Depth-first tree iteration via handler.
+     * * if handler decides the instance range is active, process appData, then recurse on children
+     * * if handler decides to abort after processing an appData, skip processing rest of appData and children
+     */
+    searchTopDown(handler) {
+        if (handler.isRangeActive(this._range)) {
+            let itemToProcess;
+            for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {
+                // console.log(itemToProcess);
+                handler.processAppData(itemToProcess);
+                if (handler.isAborted())
+                    return;
+            }
+            let child;
+            for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {
+                child.searchTopDown(handler);
+            }
+        }
+    }
+    /**
+     * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.
+     * @param leftAppData singleton or array with data "from left"
+     * @param rightStack stack of nodes to process from right path.
+     * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.
+     * @param handler search handler
+     */
+    static processAppDataAndAppDataStack(leftAppData, rightStack, reverseArgs, handler) {
+        if (leftAppData !== undefined) {
+            let leftItem;
+            let rightItem;
+            // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.
+            for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {
+                const rightAppData = rightStack[rangeIndex]._appData;
+                for (let rightIndex = 0; undefined !== (rightItem = getByIndex(rightIndex, rightAppData)); rightIndex++) {
+                    for (let leftIndex = 0; undefined !== (leftItem = getByIndex(leftIndex, leftAppData)); leftIndex++) {
+                        if (!reverseArgs)
+                            handler.processAppDataPair(leftItem, rightItem);
+                        else
+                            handler.processAppDataPair(rightItem, leftItem);
+                        if (handler.isAborted())
+                            return;
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.
+     * @param leftAppData singleton or array with data "from left"
+     * @param rightAppData singleton or array with data "from right"
+     * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.
+     * @param handler search handler
+     */
+    static processAppDataAndAppData(leftAppData, rightAppData, reverseArgs, handler) {
+        if (leftAppData !== undefined && rightAppData !== undefined) {
+            let leftItem;
+            let rightItem;
+            for (let rightIndex = 0; undefined !== (rightItem = getByIndex(rightIndex, rightAppData)); rightIndex++) {
+                for (let leftIndex = 0; undefined !== (leftItem = getByIndex(leftIndex, leftAppData)); leftIndex++) {
+                    if (!reverseArgs)
+                        handler.processAppDataPair(leftItem, rightItem);
+                    else
+                        handler.processAppDataPair(rightItem, leftItem);
+                    if (handler.isAborted())
+                        return;
+                }
+            }
+        }
+    }
+    /**
+     * Push the tip node to stack(s).
+     * @param tip new node (to be pushed)
+     * @param fullPath complete path, which is always extended
+     * @param partialPath partial path, which is only extended if the tip has _appData.
+     */
+    static pushPaths(tip, fullPath, partialPath) {
+        fullPath.push(tip);
+        if (tip._appData !== undefined) {
+            partialPath.push(tip);
+        }
+    }
+    /**
+     * Pop the tip node from stack(s).
+     * @param tip should match the fullPath tip.
+     * @param fullPath complete path, which is always popped
+     * @param partialPath partial path, which is only popped if the tip has _appData.
+     */
+    static popPaths(tip, fullPath, partialPath) {
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(fullPath[fullPath.length - 1] === tip);
+        fullPath.pop();
+        if (tip._appData !== undefined) {
+            partialPath.pop();
+        }
+    }
+    /**
+     * Process nodes from left and right trees of dual search.
+     * * The separate stacks for nodes that have appData is for efficiency.
+     * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.
+     * @param leftTip tip node being explored on left
+     * @param leftStack stack of prior left nodes
+     * @param leftStackWithAppData stack of prior left nodes which have appData.
+     * @param rightTip tip node being explored on right.
+     * @param rightStack stack of prior right nodes.
+     * @param rightStackWithAppData stack of prior right nodes which have appData.
+     * @param handler search handler
+     */
+    static recursivePairSearch(leftTip, leftStack, leftStackWithAppData, rightTip, rightStack, rightStackWithAppData, handler) {
+        // console.log({ leftId: leftTip._id, rightId: rightTip._id });
+        const leftTipHasAppData = leftTip._appData !== undefined;
+        const rightTipHasAppData = rightTip._appData !== undefined;
+        let leftChild;
+        let rightChild;
+        // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).
+        if (leftTipHasAppData && rightStackWithAppData.length > 0) {
+            this.processAppDataAndAppDataStack(leftTip._appData, rightStackWithAppData, false, handler);
+        }
+        if (leftStackWithAppData.length > 0 && rightTipHasAppData) {
+            this.processAppDataAndAppDataStack(rightTip._appData, leftStackWithAppData, true, handler);
+        }
+        if (handler.isRangePairActive(leftTip._range, rightTip._range)) {
+            this.processAppDataAndAppData(leftTip._appData, rightTip._appData, false, handler);
+            if (leftTip._children !== undefined && rightTip._children !== undefined) {
+                this.pushPaths(leftTip, leftStack, leftStackWithAppData);
+                this.pushPaths(rightTip, rightStack, rightStackWithAppData);
+                for (let leftIndex = 0; undefined !== (leftChild = getByIndex(leftIndex, leftTip._children)); leftIndex++) {
+                    for (let rightIndex = 0; undefined !== (rightChild = getByIndex(rightIndex, rightTip._children)); rightIndex++) {
+                        this.recursivePairSearch(leftChild, leftStack, leftStackWithAppData, rightChild, rightStack, rightStackWithAppData, handler);
+                    }
+                }
+                this.popPaths(leftTip, leftStack, leftStackWithAppData);
+                this.popPaths(rightTip, rightStack, rightStackWithAppData);
+            }
+            else if (leftTip._children !== undefined) {
+                this.leftRecursivePairSearch(leftTip, rightTip, rightStackWithAppData, false, handler);
+            }
+            else if (rightTip._children !== undefined) {
+                this.leftRecursivePairSearch(rightTip, leftTip, leftStackWithAppData, true, handler);
+            }
+        }
+    }
+    /**
+     * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.
+     * @param leftTip tip node being explored on left. Its appData is not processed.
+     * @param rightTip tip node being explored on right. It has no children.
+     * @param rightStackWithAppData stack of prior right nodes which have appData.
+     * @param reverseArgs true if the caller is exchanging the sense of left and right
+     * @param handler search handler
+     */
+    static leftRecursivePairSearch(leftTip, rightTip, rightStackWithAppData, reverseArgs, handler) {
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(rightTip._children === undefined);
+        // The (possibly deep) left children appData needs to be offered to the right path (including tip)
+        // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.
+        let leftChild;
+        for (let leftIndex = 0; undefined !== (leftChild = getByIndex(leftIndex, leftTip._children)); leftIndex++) {
+            if (handler.isRangePairActive(leftChild._range, rightTip._range)) {
+                this.processAppDataAndAppData(leftChild._appData, rightTip._appData, reverseArgs, handler);
+                this.processAppDataAndAppDataStack(leftChild._appData, rightStackWithAppData, reverseArgs, handler);
+                this.leftRecursivePairSearch(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);
+            }
+        }
+    }
+    /**
+     * Recursive search down two trees, with range tests and child processing under control of a handler.
+     * @param leftRoot root of left tree
+     * @param rightRoot root of right tree
+     * @param handler handler for range tests and child process
+     */
+    static searchTwoTreesTopDown(leftRoot, rightRoot, handler) {
+        this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);
+    }
+}
+/**
+ * Utilities for various operations on RangeTree
+ * @internal
+ */
+class RangeTreeOps {
+    /** Count nodes in this tree. */
+    static getRecursiveNodeCount(root) {
+        let count = 0;
+        root.recurseIntoTree((_node) => { count++; return true; });
+        return count;
+    }
+    /** Count appData in this tree. */
+    static getRecursiveAppDataCount(root) {
+        let count = 0;
+        root.recurseIntoTree((node) => { count += node.getNumAppData(); return true; });
+        return count;
+    }
+    /**
+     * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices
+     * @param ranges access to ranges
+     * @param appData access to AppDataType items
+     * @param index0 first index for block of items
+     * @param index1 upper limit index for block of items.
+     * @param arrayLength one more than the largest range/appData index
+     * @returns newly created node.
+     */
+    static createLeafInIndexRange(ranges, appData, index0, index1, arrayLength) {
+        const appDataBlock = [];
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
+        index1 = Math.min(index1, arrayLength);
+        // console.log({ case: "LEAF", index0, index1 });
+        for (let i = index0; i < index1; i++) {
+            appDataBlock.push(evaluateIndexToType(appData, i));
+            range.extendRange(evaluateIndexToType(ranges, i));
+        }
+        return RangeTreeNode.createCapture(range, appDataBlock, undefined);
+    }
+    /**
+     * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.
+     * @param ranges access to ranges
+     * @param appData access to AppDataType items
+     * @param index0 start index of the block to access
+     * @param index1 terminal index for the block (one after final)
+     * @param arrayLength one more than the largest range/appData index
+     * @param maxChildPerNode max number of child nodes in each interior node
+     * @param maxAppDataPerLeaf max number of appData items in each leaf.
+     * @returns
+     */
+    static createRecursiveByIndexSplits(ranges, appData, index0, index1, arrayLength, maxChildPerNode, maxAppDataPerLeaf) {
+        if (index1 > arrayLength)
+            index1 = arrayLength;
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
+        const children = [];
+        const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;
+        // console.log({ name: "createRecursive", index0, index1, maxChildrenAppData });
+        if (index1 <= index0 + maxChildrenAppData) { // index range is small enough to hold the appData in leaf children
+            // console.log({ case: "LEAF GROUP", index0, index1 });
+            for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {
+                const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);
+                if (leaf !== undefined) {
+                    range.extendRange(leaf.getRangeRef());
+                    children.push(leaf);
+                }
+            }
+        }
+        else { // split the appData among interior and leaf children
+            // console.log({ case: "INTERIOR", index0, index1 });
+            const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);
+            for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {
+                const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);
+                if (child !== undefined) {
+                    range.extendRange(child.getRangeRef());
+                    children.push(child);
+                }
+            }
+        }
+        return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;
+    }
+    /**
+     * Create a range tree by simple left-right split of given ranges.
+     * * Leaves carry the inputs in left-to-right order.
+     * * Each leaf range is labeled by its corresponding object(s) in the appData array.
+     * @param ranges access to ranges.
+     * @param appData access to AppDataType items (for leaves).
+     * @param arrayLength one more than the largest range/appData index
+     * @param maxChildrenPerNode max number of child nodes allowed for each interior node.
+     * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.
+     * @returns the root of the new tree, or undefined if array lengths differ or are zero.
+     */
+    static createByIndexSplits(ranges, appData, arrayLength, maxChildrenPerNode = 2, maxAppDataPerLeaf = 2) {
+        // console.log();
+        // const numData = getFlexDataCount(appData);
+        // console.log({ numData });
+        if (arrayLength <= 0
+            || (Array.isArray(ranges) && ranges.length !== arrayLength)
+            || (Array.isArray(appData) && appData.length !== arrayLength))
+            return undefined;
+        if (maxChildrenPerNode < 2)
+            maxChildrenPerNode = 2;
+        return RangeTreeOps.createRecursiveByIndexSplits(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);
+    }
+}
+
+
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js":
+/*!*********************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js ***!
+  \*********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "SingleTreeSearchHandlerForClosestPointInArray": () => (/* binding */ SingleTreeSearchHandlerForClosestPointInArray),
+/* harmony export */   "SingleTreeSearchHandlerForClosestPointOnLineString3d": () => (/* binding */ SingleTreeSearchHandlerForClosestPointOnLineString3d),
+/* harmony export */   "SingleTreeSearchHandlerForClosestPointOnPolyface": () => (/* binding */ SingleTreeSearchHandlerForClosestPointOnPolyface),
+/* harmony export */   "TwoTreeSearchHandlerForFacetFacetCloseApproach": () => (/* binding */ TwoTreeSearchHandlerForFacetFacetCloseApproach),
+/* harmony export */   "TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach": () => (/* binding */ TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach),
+/* harmony export */   "TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach": () => (/* binding */ TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach)
+/* harmony export */ });
+/* harmony import */ var _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../curve/CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../FacetLocationDetail */ "../../core/geometry/lib/esm/polyface/FacetLocationDetail.js");
+/* harmony import */ var _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./MinimumValueTester */ "../../core/geometry/lib/esm/polyface/RangeTree/MinimumValueTester.js");
+/* harmony import */ var _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./RangeTreeNode */ "../../core/geometry/lib/esm/polyface/RangeTree/RangeTreeNode.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+
+
+
+
+
+
+
+/**
+ * Helper class for searching for the closest point in a set of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+class SingleTreeSearchHandlerForClosestPointInArray extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint, context, maxDist) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            const iPoint = this.searchState.itemAtMinValue;
+            const cld = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);
+            cld.a = this.searchState.minValue;
+            return cld;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length === 0)
+            return undefined;
+        const cldArray = [];
+        for (let i = 0; i < this.searchState.savedItems.length; ++i) {
+            const iPoint = this.searchState.savedItems[i];
+            const cld = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);
+            cld.a = this.searchState.savedValues[i];
+            cldArray.push(cld);
+        }
+        return cldArray;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a point indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        const d = this.spacePoint.distance(this.context.points[candidateIndex]);
+        this.context.numPointTest++;
+        this.searchState.testAndSave(candidateIndex, d);
+    }
+}
+/**
+ * Helper class for searching for the closest approach between sets of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.TwoTreeDistanceMinimizationSearchHandler {
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA, contextB, maxDist) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+    }
+    /** Return the current closest approach */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the distance between two points, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.numPointTest++;
+        const pointA = this.contextA.points[indexA];
+        const pointB = this.contextB.points[indexB];
+        const d = pointA.distance(pointB);
+        if (this.searchState.isNewMinOrTrigger(d)) {
+            const cldPair = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(_curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(undefined, indexA, pointA), _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(undefined, indexB, pointB));
+            cldPair.detailA.a = cldPair.detailB.a = d;
+            this.searchState.testAndSave(cldPair, d);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest point in a linestring.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+class SingleTreeSearchHandlerForClosestPointOnLineString3d extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint, context, maxDist) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a segment indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        const segment = this._workSegment = this.context.lineString.getIndexedSegment(candidateIndex, this._workSegment);
+        if (segment) {
+            const cld = segment.closestPoint(this.spacePoint, false);
+            _curve_LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);
+            this.context.numPointTest++;
+            this.searchState.testAndSave(cld, cld.a);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest approach between linestrings.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.TwoTreeDistanceMinimizationSearchHandler {
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA, contextB, maxDist) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+    }
+    /**
+     * Return the current closest approach.
+     * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]
+     */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the closest approach between two segments, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.numPointTest++;
+        const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =
+            this.contextA.lineString.getIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA);
+        const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =
+            this.contextB.lineString.getIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB);
+        const cldPair = _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_4__.LineSegment3d.closestApproach(segA, false, segB, false);
+        if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {
+            _curve_LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);
+            _curve_LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);
+            this.searchState.testAndSave(cldPair, cldPair.detailA.a);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest point in a polyface.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+class SingleTreeSearchHandlerForClosestPointOnPolyface extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+     */
+    constructor(spacePoint, context, maxDist, searchFacetInterior = false) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+        this.searchFacetInterior = searchFacetInterior;
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a facet indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        this.context.visitor.setNumWrap(0); // so edgeCount === pointCount; closure point unnecessary for closestPoint[OnBoundary]
+        if (this.context.visitor.moveToReadIndex(candidateIndex)) {
+            let pld;
+            if (this.searchFacetInterior)
+                pld = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_5__.PolygonOps.closestPoint(this.context.visitor.point, this.spacePoint);
+            else
+                pld = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_5__.PolygonOps.closestPointOnBoundary(this.context.visitor.point, this.spacePoint);
+            this.context.numFacetTest++;
+            if (pld && this.searchState.isNewMinOrTrigger(pld.a)) {
+                const edgeCount = this.context.visitor.pointCount;
+                const fld = this.context.convexFacets
+                    ? _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.ConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld)
+                    : _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.NonConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld);
+                this.searchState.testAndSave(fld, pld.a);
+            }
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest approach between polyfaces.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+class TwoTreeSearchHandlerForFacetFacetCloseApproach extends _RangeTreeNode__WEBPACK_IMPORTED_MODULE_0__.TwoTreeDistanceMinimizationSearchHandler {
+    /** Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+    */
+    constructor(contextA, contextB, maxDist, searchFacetInterior = false) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = _MinimumValueTester__WEBPACK_IMPORTED_MODULE_1__.MinimumValueTester.create(maxDist);
+        this.searchFacetInterior = searchFacetInterior && contextA.convexFacets && contextB.convexFacets;
+    }
+    /** Return the facets with closest approach */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the closest approach between two facets, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.visitor.setNumWrap(1); // closed polygons are more efficient for PolygonOps.closestApproach
+        this.contextB.visitor.setNumWrap(1);
+        if (this.contextA.visitor.moveToReadIndex(indexA) && this.contextB.visitor.moveToReadIndex(indexB)) {
+            // ASSUME: not worth sending in maxDist here...
+            const pldPair = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_5__.PolygonOps.closestApproach(this.contextA.visitor.point, this.contextB.visitor.point, undefined, this.searchFacetInterior);
+            this.contextA.numFacetTest++;
+            if (pldPair && this.searchState.isNewMinOrTrigger(pldPair.detailA.a)) {
+                const edgeCountA = this.contextA.visitor.pointCount - 1;
+                const edgeCountB = this.contextB.visitor.pointCount - 1;
+                const fldPair = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.FacetLocationDetailPair.create(this.contextA.convexFacets ? _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.ConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA) : _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.NonConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA), this.contextB.convexFacets ? _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.ConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB) : _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_6__.NonConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB));
+                this.searchState.testAndSave(fldPair, fldPair.detailA.a);
+            }
+        }
+    }
+}
+
+
 /***/ }),
 
 /***/ "../../core/geometry/lib/esm/polyface/TaggedNumericData.js":
@@ -248133,6 +250038,9 @@ class SteppedIndexFunctionFactory {
  * @internal
  */
 class FrankeSurface {
+    constructor(scales) {
+        this.scales = scales;
+    }
     exp0(u, v) {
         return Math.exp(-0.25 * (u * u + v * v) + u + v - 2);
     }
@@ -248150,7 +250058,21 @@ class FrankeSurface {
         const f1 = 0.75 * this.exp1(u, v);
         const f2 = 0.5 * this.exp2(u, v);
         const f3 = -0.2 * this.exp3(u, v);
-        return f0 + f1 + f2 + f3;
+        if (this.scales !== undefined) {
+            const numScale = this.scales.length;
+            let f = 0;
+            if (numScale >= 1)
+                f += this.scales[0] * f0;
+            if (numScale >= 2)
+                f += this.scales[1] * f1;
+            if (numScale >= 3)
+                f += this.scales[2] * f2;
+            if (numScale >= 4)
+                f += this.scales[3] * f3;
+            return f;
+        }
+        else
+            return f0 + f1 + f2 + f3;
     }
     du(u, v) {
         const du0 = -3.375 * (u - 2) * this.exp0(u, v);
@@ -250166,6 +252088,40 @@ class Sample {
             point0.push(point0[0].clone());
         return point0;
     }
+    /**
+    * Create a grid of lat-long points on a sphere.
+    * * If pole latitudes appear in the evaluation, a single point (not a circle) is evaluated.
+    * * Circles at various latitudes proceed south to north.
+    * * If first and last angles of longitudeSweep match, that meridian is not duplicated.
+    * * Longitudes can wrap freely.
+     * @param transform local to world
+     * @param numLatitudeStep number of latitude steps (poles count if they are in the sweeps)
+     * @param numLongitudeStep number of longitude steps
+     * @param latitudeSweep angle range for latitudes
+     * @param longitudeSweep angle range for longitudes
+     */
+    static createGridPointsOnEllipsoid(transform, numLatitudeStep, numLongitudeStep, latitudeSweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_0__.AngleSweep.createStartEndDegrees(-90, 90), longitudeSweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_0__.AngleSweep.createStartEndDegrees(0, 360)) {
+        const points = [];
+        const numJ = numLatitudeStep + 1;
+        const jFractionStep = 1.0 / numJ;
+        let numI = numLongitudeStep;
+        const iFractionStep = 1.0 / numI;
+        if (longitudeSweep.isFullCircle)
+            numI--;
+        for (let j = 0; j < numJ; j++) {
+            const phi = latitudeSweep.fractionToRadians(jFractionStep * j);
+            const sinPhi = Math.sin(phi);
+            const cosPhi = Math.cos(phi);
+            const numIThisCircle = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__.Angle.isAlmostEqualRadiansAllowPeriodShift(phi, -90) ? 1 : numI;
+            for (let i = 0; i < numIThisCircle; i++) {
+                const theta = longitudeSweep.fractionToRadians(iFractionStep * i);
+                const cosTheta = Math.cos(theta);
+                const sinTheta = Math.sin(theta);
+                points.push(transform.multiplyXYZ(cosTheta * cosPhi, sinTheta * cosPhi, sinPhi));
+            }
+        }
+        return points;
+    }
     /**
      * Return an array of points on a circular arc.
      * @param edgesPerQuadrant number of edges per 90 degrees
@@ -250273,14 +252229,36 @@ class Sample {
         return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_3__.Point2d.createFrom(Sample.createRosePoint3d(theta, a));
     }
     /**
-     * Create a mesh surface from samples of a smooth function over [0,1]x[0,1].
+     * Create a mesh surface from samples of a smooth real-valued function over [0,1]x[0,1] with multiple humps and dips.
+     * * The facets are bilinear quads, so if planar facets are required, set `options.shouldTriangulate = true`.
      * @param size grid size; the number of intervals on each side of the unit square domain.
+     * @param scales = array of 4 (four) numbers to scale the corresponding Franke exponential.  If undefined, all scales are 1.
      */
-    static createMeshFromSmoothSurface(size, options) {
+    static createMeshFromFrankeSurface(size, options, scales) {
         const builder = _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_49__.PolyfaceBuilder.create(options);
-        builder.addUVGridBody(new FrankeSurface(), size, size);
+        builder.addUVGridBody(new FrankeSurface(scales), size, size);
         return builder.claimPolyface(true);
     }
+    /** Stroke a helix over the unit circle.  Place in space via a transform.
+     * The various columns of the transform become the critical measures for the (elliptic) helix:
+     * The unit cylinder maps to an elliptic cylinder with x and y columns as 0 and 90 degree vectors.
+     * the Helix pitch is equal to the length of the z axis in the transform.
+     * The completeTurns parameter (which does NOT need to be an integer) is the local z of the last point
+     */
+    static createHelixPoints(completeTurns, numPoints, placement) {
+        const points = [];
+        if (numPoints < 2)
+            numPoints = 2;
+        const dThetaRadians = completeTurns * Math.PI * 2 / (numPoints - 1);
+        const dz = completeTurns / (numPoints - 1);
+        for (let i = 0; i < numPoints; i++) {
+            const thetaRadians = dThetaRadians * i;
+            points.push(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(Math.cos(thetaRadians), Math.sin(thetaRadians), i * dz));
+        }
+        if (placement)
+            placement.multiplyPoint3dArrayInPlace(points);
+        return points;
+    }
 }
 /** Array with assorted Point2d samples */
 Sample.point2d = [
@@ -252997,7 +254975,7 @@ class LinearSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrim
     }
     /**
      * Create a sweep of a starting contour.
-     * @param contour contour to be swept
+     * @param contour contour to be swept, CAPTURED
      * @param direction sweep vector.  The contour is swept the full length of the vector.
      * @param capped true to include end caps
      */
@@ -254970,7 +256948,7 @@ class HalfEdge {
      * * The two edges are joined as edgeMate pair.
      * * The two edges are a 2-half-edge face loop in both the faceSuccessor and facePredecessor directions.
      * * Properties x,y,z,i are inserted in each half edge.
-     * @returns the reference to the first half edge created.
+     * @returns the reference to the first half edge created, set with "A" properties.
      */
     static createHalfEdgePairWithCoordinates(xA = 0, yA = 0, zA = 0, iA = 0, xB = 0, yB = 0, zB = 0, iB = 0, heArray) {
         const a = HalfEdge.createHalfEdgePair(heArray);
@@ -256008,8 +257986,9 @@ class HalfEdgeGraph {
      * * The two half edges are a 2-half-edge face loop in both the faceSuccessor and facePredecessor directions.
      * * The two half edges are added to the graph's HalfEdge set.
      * * Coordinates are set to zero.
-     * * IDs are installed in the two half edges.
-     * @returns pointer to the first half edge created, with ID set to iA.
+     * @param iA `i` property of the first created HalfEdge
+     * @param iB `i` property of the second created HalfEdge
+     * @returns pointer to the first half edge created, with `i` property set to iA.
      */
     createEdgeIdId(iA = 0, iB = 0) {
         return HalfEdge.createHalfEdgePairWithCoordinates(0.0, 0.0, 0.0, iA, 0.0, 0.0, 0.0, iB, this.allHalfEdges);
@@ -256357,21 +258336,21 @@ class HalfEdgeGraphFromIndexedLoopsContext {
      * * For an edge with index pair [indexA, indexB]:
      *   * if [indexB, indexA] has never appeared, a HalfEdge mated pair is created.
      *      * One of that mated pair becomes a HalfEdge in this loop.
-     *      * The other is "unmatched"
+     *      * The other is "unmatched" and gets the EXTERIOR mask.
      *      * When announceMatedHalfEdges(halfEdge) is called:
      *         * halfEdge and its mate are "new"
      *         * all coordinates are zeros.
-     *         * each contains (as its halfEdge.id property) one index of the [indexA,indexB] pair.
+     *         * each contains (as its `i` property) one index of the [indexA,indexB] pair.
      *         * those coordinates and indices will never be referenced again by this construction sequence -- the caller is free to mutate them as needed.
      *   * if [indexB, indexA] appeared previously (and its outer HalfEdge was left "unmatched"),
-     *              the "unmatched" HalfEdge is used in the loop being constructed.
-     * @param indices Array of indices around the edge.  This is accessed cyclically.
+     *     the "unmatched" HalfEdge is used in the loop being constructed, and its EXTERIOR mask is cleared.
+     * @param indices Array of indices around the edge.  This is accessed cyclically, so first and last indices should be different.
      * @param announceMatedHalfEdges optional function to be called as mated pairs are created. At the call,
      *     the given HalfEdge and its mate will have a pair of successive indices from the array.
      */
     insertLoop(indices, announceMatedHalfEdges) {
         const n = indices.length;
-        if (n > 1) {
+        if (n > 2) {
             let index0 = indices[indices.length - 1];
             this._halfEdgesAroundCurrentLoop.length = 0;
             for (const index1 of indices) {
@@ -286564,9 +288543,9 @@ const gBase64 = {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js":
 /*!******************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js ***!
   \******************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286583,9 +288562,9 @@ function _arrayLikeToArray(arr, len) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286600,9 +288579,9 @@ function _arrayWithHoles(arr) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js":
 /*!***********************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js ***!
   \***********************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286620,9 +288599,9 @@ function _assertThisInitialized(self) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/classCallCheck.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/classCallCheck.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/classCallCheck.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/classCallCheck.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286639,9 +288618,9 @@ function _classCallCheck(instance, Constructor) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/createClass.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/createClass.js":
 /*!*************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/createClass.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/createClass.js ***!
   \*************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286650,7 +288629,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _createClass)
 /* harmony export */ });
-/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
 
 function _defineProperties(target, props) {
   for (var i = 0; i < props.length; i++) {
@@ -286672,9 +288651,9 @@ function _createClass(Constructor, protoProps, staticProps) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/defineProperty.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/defineProperty.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/defineProperty.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/defineProperty.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286683,7 +288662,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _defineProperty)
 /* harmony export */ });
-/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
 
 function _defineProperty(obj, key, value) {
   key = (0,_toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__["default"])(key);
@@ -286702,9 +288681,9 @@ function _defineProperty(obj, key, value) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286722,9 +288701,9 @@ function _getPrototypeOf(o) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/inherits.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/inherits.js":
 /*!**********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/inherits.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/inherits.js ***!
   \**********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286733,7 +288712,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _inherits)
 /* harmony export */ });
-/* harmony import */ var _setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./setPrototypeOf.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js");
+/* harmony import */ var _setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./setPrototypeOf.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js");
 
 function _inherits(subClass, superClass) {
   if (typeof superClass !== "function" && superClass !== null) {
@@ -286754,9 +288733,9 @@ function _inherits(subClass, superClass) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/iterableToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/iterableToArray.js":
 /*!*****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/iterableToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/iterableToArray.js ***!
   \*****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286771,9 +288750,9 @@ function _iterableToArray(iter) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js":
 /*!*****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js ***!
   \*****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286788,9 +288767,9 @@ function _nonIterableRest() {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js":
 /*!***************************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js ***!
   \***************************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286799,8 +288778,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _possibleConstructorReturn)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assertThisInitialized.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assertThisInitialized.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
 
 
 function _possibleConstructorReturn(self, call) {
@@ -286814,9 +288793,9 @@ function _possibleConstructorReturn(self, call) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286835,9 +288814,9 @@ function _setPrototypeOf(o, p) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toArray.js":
 /*!*********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toArray.js ***!
   \*********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286846,10 +288825,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _toArray)
 /* harmony export */ });
-/* harmony import */ var _arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithHoles.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js");
-/* harmony import */ var _iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/iterableToArray.js");
-/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
-/* harmony import */ var _nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableRest.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js");
+/* harmony import */ var _arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithHoles.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js");
+/* harmony import */ var _iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/iterableToArray.js");
+/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
+/* harmony import */ var _nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableRest.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js");
 
 
 
@@ -286860,57 +288839,57 @@ function _toArray(arr) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPrimitive.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPrimitive.js":
 /*!*************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPrimitive.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPrimitive.js ***!
   \*************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
 "use strict";
 __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "default": () => (/* binding */ _toPrimitive)
+/* harmony export */   "default": () => (/* binding */ toPrimitive)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js");
-
-function _toPrimitive(input, hint) {
-  if ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(input) !== "object" || input === null) return input;
-  var prim = input[Symbol.toPrimitive];
-  if (prim !== undefined) {
-    var res = prim.call(input, hint || "default");
-    if ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(res) !== "object") return res;
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js");
+
+function toPrimitive(t, r) {
+  if ("object" != (0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(t) || !t) return t;
+  var e = t[Symbol.toPrimitive];
+  if (void 0 !== e) {
+    var i = e.call(t, r || "default");
+    if ("object" != (0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(i)) return i;
     throw new TypeError("@@toPrimitive must return a primitive value.");
   }
-  return (hint === "string" ? String : Number)(input);
+  return ("string" === r ? String : Number)(t);
 }
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js":
 /*!***************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js ***!
   \***************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
 "use strict";
 __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   "default": () => (/* binding */ _toPropertyKey)
+/* harmony export */   "default": () => (/* binding */ toPropertyKey)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toPrimitive.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toPrimitive.js");
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toPrimitive.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toPrimitive.js");
 
 
-function _toPropertyKey(arg) {
-  var key = (0,_toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__["default"])(arg, "string");
-  return (0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(key) === "symbol" ? key : String(key);
+function toPropertyKey(t) {
+  var i = (0,_toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__["default"])(t, "string");
+  return "symbol" == (0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(i) ? i : String(i);
 }
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js":
 /*!********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js ***!
   \********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286931,9 +288910,9 @@ function _typeof(o) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js":
 /*!****************************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js ***!
   \****************************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -286942,7 +288921,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _unsupportedIterableToArray)
 /* harmony export */ });
-/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
+/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
 
 function _unsupportedIterableToArray(o, minLen) {
   if (!o) return;
@@ -287440,15 +289419,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "t": () => (/* binding */ t),
 /* harmony export */   "use": () => (/* binding */ use)
 /* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_esm_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/typeof */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/createClass.js");
-/* harmony import */ var _babel_runtime_helpers_esm_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/esm/assertThisInitialized */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
-/* harmony import */ var _babel_runtime_helpers_esm_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/esm/inherits */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/inherits.js");
-/* harmony import */ var _babel_runtime_helpers_esm_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/esm/possibleConstructorReturn */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
-/* harmony import */ var _babel_runtime_helpers_esm_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/esm/getPrototypeOf */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
-/* harmony import */ var _babel_runtime_helpers_esm_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/esm/defineProperty */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_esm_toArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/esm/toArray */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.4/node_modules/@babel/runtime/helpers/esm/toArray.js");
+/* harmony import */ var _babel_runtime_helpers_esm_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/typeof */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_esm_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/esm/assertThisInitialized */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _babel_runtime_helpers_esm_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/esm/inherits */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/inherits.js");
+/* harmony import */ var _babel_runtime_helpers_esm_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/esm/possibleConstructorReturn */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
+/* harmony import */ var _babel_runtime_helpers_esm_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/esm/getPrototypeOf */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
+/* harmony import */ var _babel_runtime_helpers_esm_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/esm/defineProperty */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_esm_toArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/esm/toArray */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.23.8/node_modules/@babel/runtime/helpers/esm/toArray.js");
 
 
 
@@ -290276,7 +292255,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.4.0-dev.21","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.4.0-dev.21","@itwin/core-bentley":"workspace:^4.4.0-dev.21","@itwin/core-common":"workspace:^4.4.0-dev.21","@itwin/core-geometry":"workspace:^4.4.0-dev.21","@itwin/core-orbitgt":"workspace:^4.4.0-dev.21","@itwin/core-quantity":"workspace:^4.4.0-dev.21"},"//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":"^10.0.6","@types/sinon":"^17.0.2","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7.1.1","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.2.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^17.0.1","source-map-loader":"^4.0.0","typescript":"~5.0.2","typemoq":"^2.1.0","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.2.2","@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.4.0-dev.24","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","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -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.4.0-dev.24","@itwin/core-bentley":"workspace:^4.4.0-dev.24","@itwin/core-common":"workspace:^4.4.0-dev.24","@itwin/core-geometry":"workspace:^4.4.0-dev.24","@itwin/core-orbitgt":"workspace:^4.4.0-dev.24","@itwin/core-quantity":"workspace:^4.4.0-dev.24"},"//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":"^10.0.6","@types/sinon":"^17.0.2","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7.1.1","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.2.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^17.0.1","source-map-loader":"^4.0.0","typescript":"~5.0.2","typemoq":"^2.1.0","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.2.2","@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"}}');
 
 /***/ })