@itwin/rpcinterface-full-stack-tests 4.1.0-dev.25 → 4.1.0-dev.27

package/lib/dist/bundled-tests.js

@@ -60962,13 +60962,13 @@ var CurrentImdlVersion;
      * front-end is not capable of reading the tile content. Otherwise, this front-end can read the tile content even if the header specifies a
      * greater minor version than CurrentVersion.Minor, although some data may be skipped.
      */
-    CurrentImdlVersion[CurrentImdlVersion["Major"] = 31] = "Major";
+    CurrentImdlVersion[CurrentImdlVersion["Major"] = 32] = "Major";
     /** The unsigned 16-bit minor version number. If the major version in the tile header is equal to CurrentVersion.Major, then this package can
      * read the tile content even if the minor version in the tile header is greater than this value, although some data may be skipped.
      */
     CurrentImdlVersion[CurrentImdlVersion["Minor"] = 0] = "Minor";
     /** The unsigned 32-bit version number derived from the 16-bit major and minor version numbers. */
-    CurrentImdlVersion[CurrentImdlVersion["Combined"] = 2031616] = "Combined";
+    CurrentImdlVersion[CurrentImdlVersion["Combined"] = 2097152] = "Combined";
 })(CurrentImdlVersion || (CurrentImdlVersion = {}));
 /** Header embedded at the beginning of binary tile data in iMdl format describing its contents.
  * @internal
@@ -61245,6 +61245,19 @@ var Constants;
 (function (Constants) {
     Constants.minToleranceRatioMultiplier = 2;
 })(Constants || (Constants = {}));
+function compareEdgeOptions(a, b) {
+    if (typeof a !== typeof b)
+        return a ? 1 : -1;
+    if (typeof a === "boolean") {
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(typeof b === "boolean");
+        return (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(a, b);
+    }
+    (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(typeof b === "object");
+    let cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStrings)(a.type, b.type);
+    if (0 === cmp)
+        cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(a.smooth, b.smooth);
+    return cmp;
+}
 /** @internal */
 var TileOptions;
 (function (TileOptions) {
@@ -61269,8 +61282,7 @@ var TileOptions;
             useLargerTiles: 0 !== (tree.flags & TreeFlags.UseLargerTiles),
             disableMagnification: false,
             alwaysSubdivideIncompleteTiles: false,
-            enableIndexedEdges: edgeOptions && edgeOptions.indexed,
-            generateAllPolyfaceEdges: edgeOptions && edgeOptions.smooth,
+            edgeOptions,
         };
     }
     TileOptions.fromTreeIdAndContentId = fromTreeIdAndContentId;
@@ -61377,19 +61389,13 @@ class Parser {
     }
     parseEdges() {
         if ("E" !== this.cur())
-            return { indexed: false, smooth: false };
+            return { type: "non-indexed", smooth: false };
         this.eat("E");
         this.eat(":");
-        const typeStr = this.cur();
-        this.eat(typeStr);
+        const flag = this.cur();
+        this.eat(flag);
         this.eat("_");
-        switch (typeStr) {
-            case "0": return false;
-            case "2": return { indexed: true, smooth: false };
-            case "3": return { indexed: false, smooth: true };
-            case "4": return { indexed: true, smooth: true };
-            default: this.reject();
-        }
+        return "0" === flag ? false : edgeOptionsFromFlag(flag);
     }
     parseSectionCut() {
         if ("S" !== this.cur())
@@ -61419,8 +61425,10 @@ const defaultTileOptions = Object.freeze({
     useLargerTiles: true,
     disableMagnification: false,
     alwaysSubdivideIncompleteTiles: false,
-    enableIndexedEdges: true,
-    generateAllPolyfaceEdges: true,
+    edgeOptions: {
+        type: "compact",
+        smooth: true,
+    },
 });
 function contentFlagsFromId(id) {
     if (0 === id.length || "-" !== id[0])
@@ -61452,14 +61460,40 @@ function treeFlagsAndFormatVersionFromId(id) {
 function edgeOptionsFromTreeId(id) {
     const pos = id.indexOf("E:");
     if (pos <= 0)
-        return { indexed: false, smooth: false };
-    switch (id[pos + 2]) {
-        case "0": return { indexed: defaultTileOptions.enableIndexedEdges, smooth: defaultTileOptions.generateAllPolyfaceEdges };
-        case "2": return { indexed: true, smooth: false };
-        case "3": return { indexed: false, smooth: true };
-        case "4": return { indexed: true, smooth: true };
+        return { type: "non-indexed", smooth: false };
+    return edgeOptionsFromFlag(id[pos + 2]);
+}
+function edgeOptionsFromFlag(flag) {
+    if ("0" === flag)
+        return defaultTileOptions.edgeOptions;
+    const smooth = flag !== "2" && flag !== "5";
+    let type;
+    switch (flag) {
+        case "2":
+        case "4":
+            type = "indexed";
+            break;
+        case "3":
+            type = "non-indexed";
+            break;
+        case "5":
+        case "6":
+            type = "compact";
+            break;
+        default:
+            throw new Error("Invalid tree Id");
+    }
+    return { type, smooth };
+}
+function edgeOptionsToString(options) {
+    if (!options)
+        return "E:0_";
+    switch (options.type) {
+        case "non-indexed": return options.smooth ? "E:3_" : "";
+        case "indexed": return options.smooth ? "E:4_" : "E:2_";
+        case "compact": return options.smooth ? "E:6_" : "E:5_";
+        default: throw new Error("Invalid tree Id");
     }
-    throw new Error("Invalid tree Id");
 }
 /** @internal */
 function getMaximumMajorTileFormatVersion(maxMajorVersion, formatVersion) {
@@ -61487,19 +61521,6 @@ var TreeFlags;
     TreeFlags[TreeFlags["OptimizeBRepProcessing"] = 4] = "OptimizeBRepProcessing";
     TreeFlags[TreeFlags["UseLargerTiles"] = 8] = "UseLargerTiles";
 })(TreeFlags || (TreeFlags = {}));
-function compareEdgeOptions(a, b) {
-    if (typeof a !== typeof b)
-        return a ? 1 : -1;
-    if (typeof a === "boolean") {
-        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(typeof b === "boolean");
-        return (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(a, b);
-    }
-    (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(typeof b === "object");
-    let cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(a.indexed, b.indexed);
-    if (0 === cmp)
-        cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(a.smooth, b.smooth);
-    return cmp;
-}
 function animationIdToString(animationId) {
     return `A:${animationId}_`;
 }
@@ -61518,16 +61539,7 @@ function iModelTileTreeIdToString(modelId, treeId, options) {
             idStr = `${idStr}${animationIdToString(treeId.animationId)}`;
         else if (treeId.enforceDisplayPriority) // animation and priority are currently mutually exclusive
             flags |= TreeFlags.EnforceDisplayPriority;
-        let edges;
-        if (!treeId.edges) {
-            edges = "E:0_";
-        }
-        else {
-            if (!treeId.edges.smooth)
-                edges = treeId.edges.indexed ? "E:2_" : "";
-            else
-                edges = treeId.edges.indexed ? "E:4_" : "E:3_";
-        }
+        const edges = edgeOptionsToString(treeId.edges);
         const sectionCut = treeId.sectionCut ? `S${treeId.sectionCut}s` : "";
         idStr = `${idStr}${edges}${sectionCut}`;
     }
@@ -97706,6 +97718,116 @@ function isGltf1Material(material) {
 }
 
 
+/***/ }),
+
+/***/ "../../core/frontend/lib/esm/common/imdl/CompactEdges.js":
+/*!***************************************************************!*\
+  !*** ../../core/frontend/lib/esm/common/imdl/CompactEdges.js ***!
+  \***************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "indexedEdgeParamsFromCompactEdges": () => (/* binding */ indexedEdgeParamsFromCompactEdges)
+/* 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 _ImdlSchema__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./ImdlSchema */ "../../core/frontend/lib/esm/common/imdl/ImdlSchema.js");
+/* harmony import */ var _render_primitives_EdgeParams__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../render/primitives/EdgeParams */ "../../core/frontend/lib/esm/common/render/primitives/EdgeParams.js");
+/* harmony import */ var _render_primitives_VertexIndices__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../render/primitives/VertexIndices */ "../../core/frontend/lib/esm/common/render/primitives/VertexIndices.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 Tiles
+ */
+
+
+
+
+/** Iterate over the compact edges.
+ * @note The same object is returned on each iteration, mutated in place.
+ */
+function* compactEdgeIterator(visibilityFlags, vertexIndices, normalPairs) {
+    let bitIndex = 0;
+    let flagsIndex = 0;
+    let normalIndex = 0;
+    const output = { index0: 0, index1: 1 };
+    for (let i = 0; i < vertexIndices.length; i++) {
+        const visibility = (visibilityFlags[flagsIndex] >> bitIndex) & 3;
+        bitIndex += 2;
+        if (bitIndex === 8) {
+            bitIndex = 0;
+            flagsIndex++;
+        }
+        if (_ImdlSchema__WEBPACK_IMPORTED_MODULE_1__.ImdlEdgeVisibility.Hidden === visibility)
+            continue;
+        output.index0 = vertexIndices.decodeIndex(i);
+        output.index1 = vertexIndices.decodeIndex(i % 3 === 2 ? i - 2 : i + 1);
+        if (_ImdlSchema__WEBPACK_IMPORTED_MODULE_1__.ImdlEdgeVisibility.Silhouette === visibility) {
+            (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(undefined !== normalPairs);
+            output.normals = normalPairs[normalIndex++];
+        }
+        else {
+            output.normals = undefined;
+        }
+        yield output;
+    }
+}
+function setUint24(edgeTable, byteIndex, value) {
+    edgeTable[byteIndex + 0] = value & 0x0000ff;
+    edgeTable[byteIndex + 1] = (value & 0x00ff00) >>> 8;
+    edgeTable[byteIndex + 2] = (value & 0xff0000) >>> 16;
+}
+/** Convert an [[ImdlCompactEdges]] to an [[IndexedEdgeParams]].
+ * @internal
+ */
+function indexedEdgeParamsFromCompactEdges(compact) {
+    const numSilhouettes = compact.normalPairs?.length ?? 0;
+    const numTotalEdges = compact.numVisibleEdges + numSilhouettes;
+    if (numTotalEdges <= 0)
+        return undefined;
+    // Each edge is a quad consisting of six vertices. Each vertex is an identical 24-bit index into the lookup table.
+    const indices = new _render_primitives_VertexIndices__WEBPACK_IMPORTED_MODULE_3__.VertexIndices(new Uint8Array(numTotalEdges * 6 * 3));
+    for (let i = 0; i < numTotalEdges; i++)
+        for (let j = 0; j < 6; j++)
+            indices.setNthIndex(i * 6 + j, i);
+    const { width, height, silhouettePadding, silhouetteStartByteIndex } = (0,_render_primitives_EdgeParams__WEBPACK_IMPORTED_MODULE_2__.calculateEdgeTableParams)(compact.numVisibleEdges, numSilhouettes, compact.maxEdgeTableDimension);
+    const edgeTable = new Uint8Array(width * height * 4);
+    let curVisibleIndex = 0;
+    let curSilhouetteIndex = 0;
+    for (const edge of compactEdgeIterator(compact.visibility, compact.vertexIndices, compact.normalPairs)) {
+        if (undefined === edge.normals) {
+            const index = curVisibleIndex++;
+            const byteIndex = index * 6;
+            setUint24(edgeTable, byteIndex, edge.index0);
+            setUint24(edgeTable, byteIndex + 3, edge.index1);
+        }
+        else {
+            const index = curSilhouetteIndex++;
+            const byteIndex = silhouetteStartByteIndex + silhouettePadding + index * 10;
+            setUint24(edgeTable, byteIndex, edge.index0);
+            setUint24(edgeTable, byteIndex + 3, edge.index1);
+            edgeTable[byteIndex + 6] = edge.normals & 0xff;
+            edgeTable[byteIndex + 7] = (edge.normals & 0xff00) >>> 8;
+            edgeTable[byteIndex + 8] = (edge.normals & 0xff0000) >>> 16;
+            edgeTable[byteIndex + 9] = (edge.normals & 0xff000000) >>> 24;
+        }
+    }
+    return {
+        indices: indices.data,
+        edges: {
+            data: edgeTable,
+            width,
+            height,
+            numSegments: compact.numVisibleEdges,
+            silhouettePadding,
+        },
+    };
+}
+
+
 /***/ }),
 
 /***/ "../../core/frontend/lib/esm/common/imdl/ImdlModel.js":
@@ -97797,6 +97919,9 @@ function collectTransferables(document) {
 
 "use strict";
 __webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "ImdlEdgeVisibility": () => (/* binding */ ImdlEdgeVisibility)
+/* harmony export */ });
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -97804,7 +97929,18 @@ __webpack_require__.r(__webpack_exports__);
 /** @packageDocumentation
  * @module Tiles
  */
-
+/** As part of [[ImdlCompactEdges]], describes the visibility of an edge of a triangle.
+ * @internal
+ */
+var ImdlEdgeVisibility;
+(function (ImdlEdgeVisibility) {
+    /** The edge is never visible. */
+    ImdlEdgeVisibility[ImdlEdgeVisibility["Hidden"] = 0] = "Hidden";
+    /** The edge is shared between two adjacent triangles. It is visible only if one triangle is facing away from the viewer and the other is facing toward the viewer. */
+    ImdlEdgeVisibility[ImdlEdgeVisibility["Silhouette"] = 1] = "Silhouette";
+    /** The edge is always visible. */
+    ImdlEdgeVisibility[ImdlEdgeVisibility["Visible"] = 2] = "Visible";
+})(ImdlEdgeVisibility || (ImdlEdgeVisibility = {}));
 
 
 /***/ }),
@@ -97834,6 +97970,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _render_primitives_VertexTableSplitter__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../render/primitives/VertexTableSplitter */ "../../core/frontend/lib/esm/common/render/primitives/VertexTableSplitter.js");
 /* harmony import */ var _render_AnimationNodeId__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../render/AnimationNodeId */ "../../core/frontend/lib/esm/common/render/AnimationNodeId.js");
 /* harmony import */ var _render_primitives_VertexIndices__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../render/primitives/VertexIndices */ "../../core/frontend/lib/esm/common/render/primitives/VertexIndices.js");
+/* harmony import */ var _CompactEdges__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./CompactEdges */ "../../core/frontend/lib/esm/common/imdl/CompactEdges.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -97851,6 +97988,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /** Header preceding "glTF" data in iMdl tile. */
 class GltfHeader extends _itwin_core_common__WEBPACK_IMPORTED_MODULE_2__.TileHeader {
     get isValid() { return _itwin_core_common__WEBPACK_IMPORTED_MODULE_2__.TileFormat.Gltf === this.format; }
@@ -98353,13 +98491,28 @@ class Parser {
             },
         };
     }
-    parseEdges(imdl, displayParams) {
+    parseCompactEdges(imdl, vertexIndices) {
+        const visibility = this.findBuffer(imdl.visibility);
+        if (!visibility)
+            return undefined;
+        const normals = undefined !== imdl.normalPairs ? this.findBuffer(imdl.normalPairs) : undefined;
+        return (0,_CompactEdges__WEBPACK_IMPORTED_MODULE_10__.indexedEdgeParamsFromCompactEdges)({
+            numVisibleEdges: imdl.numVisible,
+            visibility,
+            vertexIndices,
+            normalPairs: normals ? new Uint32Array(normals.buffer, normals.byteOffset, normals.byteLength / 4) : undefined,
+            maxEdgeTableDimension: this._options.maxVertexTableSize,
+        });
+    }
+    parseEdges(imdl, displayParams, indices) {
         if (!imdl)
             return undefined;
         const segments = imdl.segments ? this.parseSegmentEdges(imdl.segments) : undefined;
         const silhouettes = imdl.silhouettes ? this.parseSilhouetteEdges(imdl.silhouettes) : undefined;
-        const indexed = imdl.indexed ? this.parseIndexedEdges(imdl.indexed) : undefined;
         const polylines = imdl.polylines ? this.parseTesselatedPolyline(imdl.polylines) : undefined;
+        let indexed = imdl.indexed ? this.parseIndexedEdges(imdl.indexed) : undefined;
+        if (!indexed && imdl.compact)
+            indexed = this.parseCompactEdges(imdl.compact, new _render_primitives_VertexIndices__WEBPACK_IMPORTED_MODULE_9__.VertexIndices(indices));
         if (!segments && !silhouettes && !indexed && !polylines)
             return undefined;
         return {
@@ -98446,7 +98599,7 @@ class Parser {
                             surface,
                             isPlanar,
                             auxChannels: this.parseAuxChannelTable(docPrimitive),
-                            edges: this.parseEdges(docPrimitive.edges, displayParams),
+                            edges: this.parseEdges(docPrimitive.edges, displayParams, surface.indices),
                         },
                     };
                 }
@@ -100483,6 +100636,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   "ImageryMapTile": () => (/* reexport safe */ _tile_internal__WEBPACK_IMPORTED_MODULE_125__.ImageryMapTile),
 /* harmony export */   "ImageryMapTileTree": () => (/* reexport safe */ _tile_internal__WEBPACK_IMPORTED_MODULE_125__.ImageryMapTileTree),
 /* harmony export */   "ImageryTileTreeState": () => (/* reexport safe */ _tile_internal__WEBPACK_IMPORTED_MODULE_125__.ImageryTileTreeState),
+/* harmony export */   "ImdlEdgeVisibility": () => (/* reexport safe */ _common_imdl_ImdlSchema__WEBPACK_IMPORTED_MODULE_15__.ImdlEdgeVisibility),
 /* harmony export */   "ImdlReader": () => (/* reexport safe */ _tile_internal__WEBPACK_IMPORTED_MODULE_125__.ImdlReader),
 /* harmony export */   "IndexBuffer": () => (/* reexport safe */ _common_render_primitives_VertexTableSplitter__WEBPACK_IMPORTED_MODULE_29__.IndexBuffer),
 /* harmony export */   "InputCollector": () => (/* reexport safe */ _tools_Tool__WEBPACK_IMPORTED_MODULE_135__.InputCollector),
@@ -106975,7 +107129,7 @@ function createEdgeParams(meshArgs, maxWidth) {
     let segments;
     let silhouettes;
     let indexed;
-    if (_IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tileAdmin.enableIndexedEdges) {
+    if ("non-indexed" !== _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tileAdmin.edgeOptions.type) {
         indexed = buildIndexedEdges(args, !doJoints, maxWidth ?? _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.renderSystem.maxTextureSize);
     }
     else {
@@ -138928,7 +139082,7 @@ class GraphicsTile extends _internal__WEBPACK_IMPORTED_MODULE_4__.Tile {
             location: this.tree.iModelTransform.toJSON(),
             contentFlags: idProvider.contentFlags,
             omitEdges: !this.tree.edgeOptions,
-            edgeType: this.tree.edgeOptions && this.tree.edgeOptions.indexed ? 2 : 1,
+            edgeType: this.tree.edgeOptions && "non-indexed" !== this.tree.edgeOptions.type ? 2 : 1,
             smoothPolyfaceEdges: this.tree.edgeOptions && this.tree.edgeOptions.smooth,
             clipToProjectExtents: true,
             sectionCut: this.tree.stringifiedSectionClip,
@@ -141312,6 +141466,7 @@ class IModelTileTree extends _internal__WEBPACK_IMPORTED_MODULE_6__.TileTree {
          * used by draw().
          */
         this._numStaticTilesSelected = 0;
+        this.iModelTileTreeId = treeId;
         this.contentIdQualifier = params.contentIdQualifier;
         this.geometryGuid = params.geometryGuid;
         this.tileScreenSize = params.tileScreenSize;
@@ -146507,8 +146662,10 @@ class TileAdmin {
         this._defaultTileSizeModifier = (undefined !== options.defaultTileSizeModifier && options.defaultTileSizeModifier > 0) ? options.defaultTileSizeModifier : 1.0;
         this._retryInterval = undefined !== options.retryInterval ? options.retryInterval : 1000;
         this._enableInstancing = options.enableInstancing ?? _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.defaultTileOptions.enableInstancing;
-        this._enableIndexedEdges = options.enableIndexedEdges ?? _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.defaultTileOptions.enableIndexedEdges;
-        this._generateAllPolyfaceEdges = options.generateAllPolyfaceEdges ?? _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.defaultTileOptions.generateAllPolyfaceEdges;
+        this.edgeOptions = {
+            type: false === options.enableIndexedEdges ? "non-indexed" : "compact",
+            smooth: options.generateAllPolyfaceEdges ?? true,
+        };
         this.enableImprovedElision = options.enableImprovedElision ?? _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.defaultTileOptions.enableImprovedElision;
         this.enableFrontendScheduleScripts = options.enableFrontendScheduleScripts ?? false;
         this.decodeImdlInWorker = options.decodeImdlInWorker ?? true;
@@ -146600,18 +146757,6 @@ class TileAdmin {
     }
     /** @internal */
     get enableInstancing() { return this._enableInstancing; }
-    /** @internal */
-    get enableIndexedEdges() { return this._enableIndexedEdges; }
-    /** @internal */
-    get generateAllPolyfaceEdges() { return this._generateAllPolyfaceEdges; }
-    set generateAllPolyfaceEdges(val) { this._generateAllPolyfaceEdges = val; }
-    /** @internal */
-    get edgeOptions() {
-        return {
-            indexed: this.enableIndexedEdges,
-            smooth: this.generateAllPolyfaceEdges,
-        };
-    }
     /** Given a numeric combined major+minor tile format version (typically obtained from a request to the backend to query the maximum tile format version it supports),
      * return the maximum *major* format version to be used to request tile content from the backend.
      * @see [[TileAdmin.Props.maximumMajorTileFormatVersion]]
@@ -146926,7 +147071,7 @@ class TileAdmin {
      */
     async requestElementGraphics(iModel, requestProps) {
         if (true !== requestProps.omitEdges && undefined === requestProps.edgeType)
-            requestProps = { ...requestProps, edgeType: this.enableIndexedEdges ? 2 : 1 };
+            requestProps = { ...requestProps, edgeType: "non-indexed" !== this.edgeOptions.type ? 2 : 1 };
         // For backwards compatibility, these options default to true in the backend. Explicitly set them to false in (newer) frontends if not supplied.
         if (undefined === requestProps.quantizePositions || undefined === requestProps.useAbsolutePositions) {
             requestProps = {
@@ -152179,18 +152324,25 @@ class ImageryMapLayerTreeSupplier {
      * This allows the ID to serve as a lookup key to find the corresponding TileTree.
      */
     compareTileTreeIds(lhs, rhs) {
-        let cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStrings)(lhs.settings.url, rhs.settings.url);
+        let cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStrings)(lhs.settings.formatId, rhs.settings.formatId);
         if (0 === cmp) {
-            cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStringsOrUndefined)(lhs.settings.userName, rhs.settings.userName);
+            cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStrings)(lhs.settings.url, rhs.settings.url);
             if (0 === cmp) {
-                cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStringsOrUndefined)(lhs.settings.password, rhs.settings.password);
+                cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStringsOrUndefined)(lhs.settings.userName, rhs.settings.userName);
                 if (0 === cmp) {
-                    cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(lhs.settings.transparentBackground, rhs.settings.transparentBackground);
+                    cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStringsOrUndefined)(lhs.settings.password, rhs.settings.password);
                     if (0 === cmp) {
-                        cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareNumbers)(lhs.settings.subLayers.length, rhs.settings.subLayers.length);
+                        cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(lhs.settings.transparentBackground, rhs.settings.transparentBackground);
                         if (0 === cmp) {
-                            for (let i = 0; i < lhs.settings.subLayers.length && 0 === cmp; i++)
-                                cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(lhs.settings.subLayers[i].visible, rhs.settings.subLayers[i].visible);
+                            cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareNumbers)(lhs.settings.subLayers.length, rhs.settings.subLayers.length);
+                            if (0 === cmp) {
+                                for (let i = 0; i < lhs.settings.subLayers.length && 0 === cmp; i++) {
+                                    cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareStrings)(lhs.settings.subLayers[i].name, rhs.settings.subLayers[i].name);
+                                    if (0 === cmp) {
+                                        cmp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.compareBooleans)(lhs.settings.subLayers[i].visible, rhs.settings.subLayers[i].visible);
+                                    }
+                                }
+                            }
                         }
                     }
                 }
@@ -182629,6 +182781,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePrimitive
     /**
      * Return a clone of this arc, projected to given z value.
      * * If `z` is omitted, the clone is at the z of the center.
+     * * This function projects the arc into a plane parallel to xy-plane.
      * * Note that projection to fixed z can change circle into ellipse (and (rarely) ellipse to circle)
      */
     cloneAtZ(z) {
@@ -184643,10 +184796,12 @@ __webpack_require__.r(__webpack_exports__);
  * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:
  * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.
  * The two instantiable forms of `CurveChain` are
- *   - `Path` - A chain not required to close, and not enclosing a planar area
- *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed.
- * - `ParityRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by parity rules
- * - `UnionRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by union rules
+ *   - `Path` - A chain not required to close and not enclosing a planar area (so curves do not have to be on the
+ * same plane).
+ *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed (so curves have to
+ * be on the same plane).
+ * - `ParityRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by parity rules.
+ * - `UnionRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by union rules.
  * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.
  *
  * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.
@@ -184686,7 +184841,7 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
      * Return the max gap between adjacent primitives in Path and Loop collections.
      * * In a Path, gaps are computed between consecutive primitives.
      * * In a Loop, gaps are computed between consecutive primitives and between last and first.
-     * * gaps are NOT computed between consecutive CurvePrimitives in "unstructured" collections.  The type is
+     * * Gaps are NOT computed between consecutive CurvePrimitives in "unstructured" collections. The type is
      * "unstructured" so gaps should not be semantically meaningful.
      */
     maxGap() {
@@ -184708,11 +184863,15 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
     cloneTransformed(transform) {
         return _internalContexts_CloneCurvesContext__WEBPACK_IMPORTED_MODULE_7__.CloneCurvesContext.clone(this, transform);
     }
-    /** Create a deep copy with all linestrings expanded to multiple LineSegment3d. */
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
     cloneWithExpandedLineStrings() {
         return _internalContexts_CloneWithExpandedLineStrings__WEBPACK_IMPORTED_MODULE_8__.CloneWithExpandedLineStrings.clone(this);
     }
-    /** Recurse through children to collect CurvePrimitive's in flat array. */
+    /**
+     * Push all CurvePrimitives contained in the instance onto the `results` array.
+     * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives
+     * of the Loop are pushed onto `results`.
+     */
     collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings = false) {
         if (this.children) {
             for (const child of this.children) {
@@ -184724,10 +184883,12 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
         }
     }
     /**
-     * Return an array containing only the curve primitives.
+     * Return an array containing all CurvePrimitives in the instance.
+     * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of
+     * the Loop are pushed onto the returned array.
      * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without
-     * clearing the array.)
-     * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself.  If true,
+     * clearing the array).
+     * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,
      * it recurses to its (otherwise hidden) children.
      */
     collectCurvePrimitives(collectorArray, smallestPossiblePrimitives = false, explodeLineStrings = false) {
@@ -184742,7 +184903,7 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
      * * `UnionRegion`
      */
     get isAnyRegionType() {
-        return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 5 || this.dgnBoundaryType() === 4;
+        return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;
     }
     /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */
     get isOpenPath() {
@@ -184750,12 +184911,16 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
     }
     /**
      * Return true for a single-loop planar region type, i.e. `Loop`.
-     * * This is _not- a test for physical closure of a `Path`
+     * * This is NOT a test for physical closure of a `Path`.
      */
     get isClosedPath() {
         return this.dgnBoundaryType() === 2;
     }
-    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */
+    /**
+     * Extend (increase) the given range as needed to encompass all curves in the curve collection.
+     * @param rangeToExtend the given range.
+     * @param transform if supplied, the range is extended with transformed curves.
+     */
     extendRange(rangeToExtend, transform) {
         const children = this.children;
         if (children) {
@@ -184765,8 +184930,8 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
         }
     }
     /**
-     * * Find any curve primitive in the source.
-     * * Evaluate it at a fraction (which by default is an interior fraction)
+     * Find any CurvePrimitive in the source and evaluate it at the given fraction.
+     * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.
      * @param source containing `CurvePrimitive` or `CurveCollection`
      * @param fraction fraction to use in `curve.fractionToPoint(fraction)`
      */
@@ -184798,19 +184963,20 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
 }
 /**
  * Shared base class for use by both open and closed paths.
- * - A `CurveChain` contains only curvePrimitives.  No other paths, loops, or regions allowed.
- * - A single entry in the chain can in fact contain multiple curve primitives if the entry itself is (for instance)
- * `CurveChainWithDistanceIndex`
- *   which presents itself (through method interface) as a CurvePrimitive with well defined mappings from fraction
- * to xyz, but in fact does all the
- *   calculations over multiple primitives.
- * - The specific derived classes are `Path` and `Loop`
- * - `CurveChain` is an intermediate class.   It is not instantiable on its own.
+ * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.
+ * * The specific derived classes are `Path` and `Loop`
+ * * `CurveChain` is an intermediate class. It is not instantiable on its own.
+ * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings
+ * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.
  * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.
  * @public
  */
 class CurveChain extends CurveCollection {
-    constructor() { super(); this._curves = []; }
+    /** Constructor */
+    constructor() {
+        super();
+        this._curves = [];
+    }
     /** Return the array of `CurvePrimitive` */
     get children() {
         if (this._curves === undefined)
@@ -184818,7 +184984,7 @@ class CurveChain extends CurveCollection {
         return this._curves;
     }
     /**
-     * Return the `[index]` curve primitive, optionally using `modulo` to map`index` to the cyclic indexing.
+     * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.
      * * In particular, `-1` is the final curve.
      * @param index cyclic index
      */
@@ -184826,8 +184992,7 @@ class CurveChain extends CurveCollection {
         const n = this.children.length;
         if (n === 0)
             return undefined;
-        /** Try simplest non-cyclic access first . . */
-        if (index >= 0 && index < n)
+        if (index >= 0 && index < n) // try simplest non-cyclic access first
             return this.children[index];
         if (cyclic) {
             const index2 = _Geometry__WEBPACK_IMPORTED_MODULE_10__.Geometry.modulo(index, n);
@@ -184840,6 +185005,11 @@ class CurveChain extends CurveCollection {
      * @param options tolerance parameters controlling the stroking.
      */
     getPackedStrokes(options) {
+        /**
+         * The object returned by "cloneStroked" has the same type (Loop or Path) but instead of a chain of
+         * CurvePrimitives as children, it has a single LineString3d child. "getPackedStrokes" just returns
+         * the points of that LineString3d using "packedPoints".
+         */
         const tree = this.cloneStroked(options);
         if (tree instanceof CurveChain) {
             const children = tree.children;
@@ -184851,16 +185021,6 @@ class CurveChain extends CurveCollection {
         }
         return undefined;
     }
-    /*  EDL 01/20 Path, Loop, CurveChainWithDistanceIndex all implement this.
-        Reducing it to abstract.
-        Hypothetically, a derived class in the wild might be depending on this.
-     {
-      const strokes = LineString3d.create();
-      for (const curve of this.children)
-        curve.emitStrokes(strokes, options);
-      return strokes;
-    }
-    */
     /**
      * Add a child curve.
      * * Returns false if the given child is not a CurvePrimitive.
@@ -184893,7 +185053,7 @@ class CurveChain extends CurveCollection {
         this._curves.reverse();
     }
     /**
-     * Return the index where target is found in the array of children
+     * Return the index where target is found in the array of children.
      * @param alsoSearchProxies whether to also check proxy curves of the children
     */
     childIndex(target, alsoSearchProxies) {
@@ -184912,7 +185072,7 @@ class CurveChain extends CurveCollection {
         }
         return undefined;
     }
-    /** Evaluate an indexed curve at a fraction.  Return as a CurveLocationDetail that indicates the primitive. */
+    /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */
     primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(index, fraction, cyclic = false, result) {
         const primitive = this.cyclicCurvePrimitive(index, cyclic);
         if (primitive) {
@@ -188144,7 +188304,7 @@ var CurveIntervalRole;
 (function (CurveIntervalRole) {
     /** This point is an isolated point NOT at a primary vertex. */
     CurveIntervalRole[CurveIntervalRole["isolated"] = 0] = "isolated";
-    /**  This point is an isolated vertex hit */
+    /** This point is an isolated vertex hit */
     CurveIntervalRole[CurveIntervalRole["isolatedAtVertex"] = 1] = "isolatedAtVertex";
     /** This is the beginning of an interval */
     CurveIntervalRole[CurveIntervalRole["intervalStart"] = 10] = "intervalStart";
@@ -188159,11 +188319,11 @@ var CurveIntervalRole;
  */
 var CurveSearchStatus;
 (function (CurveSearchStatus) {
-    /** unimplemented or zero length curve  */
+    /** Unimplemented or zero length curve  */
     CurveSearchStatus[CurveSearchStatus["error"] = 0] = "error";
-    /** complete success of search */
+    /** Complete success of search */
     CurveSearchStatus[CurveSearchStatus["success"] = 1] = "success";
-    /** search ended prematurely (e.g. at incomplete distance moved) at start or end of curve */
+    /** Search ended prematurely (e.g. at incomplete distance moved) at start or end of curve */
     CurveSearchStatus[CurveSearchStatus["stoppedAtBoundary"] = 2] = "stoppedAtBoundary";
 })(CurveSearchStatus || (CurveSearchStatus = {}));
 /**
@@ -188186,7 +188346,7 @@ function optionalVectorUpdate(source, result) {
  * @public
  */
 class CurveLocationDetail {
-    /** constructor */
+    /** Constructor */
     constructor() {
         this.pointQ = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.createZero();
         this.fraction = 0;
@@ -188284,8 +188444,10 @@ class CurveLocationDetail {
         return this.setFP(fraction, ray.origin, ray.direction, a);
     }
     /** Set the CurvePrimitive pointer, leaving all other properties untouched. */
-    setCurve(curve) { this.curve = curve; }
-    /** record the distance from the CurveLocationDetail's point to the parameter point. */
+    setCurve(curve) {
+        this.curve = curve;
+    }
+    /** Record the distance from the CurveLocationDetail's point to the parameter point. */
     setDistanceTo(point) {
         this.a = this.point.distance(point);
     }
@@ -188688,7 +188850,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.Geometr
     }
     /**
      * Returns a (high accuracy) range of the curve between fractional positions
-     * * Default implementation returns the range of the curve from clonePartialCurve
+     * * Default implementation returns the range of the curve from clonePartialCurve.
      */
     rangeBetweenFractions(fraction0, fraction1, transform) {
         return this.rangeBetweenFractionsByClone(fraction0, fraction1, transform);
@@ -188717,6 +188879,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.Geometr
      * @param fraction0 start fraction for evaluation
      * @param fraction1 end fraction for evaluation
      * @param count number of points to evaluate
+     * @param transform optional transform to be applied to the curve
      * @param extrapolationFactor if positive, evaluate again at interval midpoints and apply this fraction multiplier
      * to any increase in size.
      */
@@ -188804,8 +188967,8 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.Geometr
      *    * `curveStartState` = `CurveSearchStatus.error`
      * @param startFraction fractional position where the move starts
      * @param signedDistance distance to move.   Negative distance is backwards in the fraction space
-     * @param allowExtension if true, all the move to go beyond the startPoint or endpoint of the curve.  If false, do not
-     * allow movement beyond the startPoint or endpoint
+     * @param allowExtension if true, allow the move to go beyond the startPoint or endpoint of the curve.  If false,
+     * do not allow movement beyond the startPoint or endpoint
      * @param result optional result.
      * @returns A CurveLocationDetail annotated as above. Note that if the curve does not support the calculation, there is
      * still a result which contains the point at the input startFraction, with failure indicated in the `curveStartState`
@@ -189514,8 +189677,8 @@ __webpack_require__.r(__webpack_exports__);
  * * A 3d line segment represented by its start and end coordinates
  *   * startPoint
  *   * endPoint
- * * The segment is parameterized with fraction 0 at the start and fraction 1 at the end, i.e. either of these
- * equivalent forms to map fraction `f` to a point `X(f)`
+ * * The segment is parameterized with fraction 0 at the start and fraction 1 at the end, i.e. each of these
+ * equivalent forms maps fraction `f` to a point `X(f)`:
  * ```
  * equation
  *  X(f) = P_0 + f*(P_1 - P_0)\newline
@@ -189530,14 +189693,14 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePr
     }
     /**
      * Return REFERENCE to the start point of this segment.
-     * * (This is distinct from the `CurvePrimitive` abstract method `endPoint()` which creates a returned point
+     * * This is distinct from the `CurvePrimitive` abstract method `startPoint()` which creates a returned point.
      */
     get point0Ref() {
         return this._point0;
     }
     /**
      * Return REFERENCE to the end point of this segment.
-     * * (This is distinct from the `CurvePrimitive` abstract method `endPoint()` which creates a returned point
+     * * This is distinct from the `CurvePrimitive` abstract method `endPoint()` which creates a returned point.
      */
     get point1Ref() {
         return this._point1;
@@ -190937,7 +191100,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         return ls;
     }
     /**
-     * Evaluate a curve at uniform fractions.  Append the evaluations to this linestring.
+     * Evaluate a curve at uniform fractions. Append the evaluations to this linestring.
      * @param curve primitive to evaluate.
      * @param numStrokes number of strokes (edges).
      * @param fraction0 starting fraction coordinate
@@ -193734,8 +193897,8 @@ var RegionBinaryOpType;
  *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.
  * The common "One outer loop and many Inner loops" is a parity region.
  *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.
- * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been
- * rotated parallel to the xy-plane.
+ * * **NOTE:** Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has
+ * been rotated parallel to the xy-plane.
  * @public
  */
 class RegionOps {
@@ -193985,34 +194148,29 @@ class RegionOps {
         return RegionOps.sortOuterAndHoleLoopsXY(allLoops);
     }
     /**
-     * Construct a wire (not area!!) that is offset from given polyline or polygon.
-     * * This is a simple wire offset, not an area.
+     * Construct a wire that is offset from the given polyline or polygon.
+     * * This is a simple wire offset, not an area offset.
+     * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)
+     * the xy-plane.
      * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not
      * guarantee a simple area offset.
-     * * The construction algorithm is subject to being changed, resulting in different (hopefully better)
-     * self-intersection behavior on the future.
+     * * If offsetDistance is given as a number, default OffsetOptions are applied.
+     * * See [[JointOptions]] class doc for offset construction rules.
      * @param points a single loop or path
      * @param wrap true to include wraparound
-     * @param offsetDistance distance of offset from wire.  Positive is left.
+     * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions
+     * object.
      */
-    static constructPolygonWireXYOffset(points, wrap, offsetDistance) {
+    static constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions) {
         const context = new _internalContexts_PolygonOffsetContext__WEBPACK_IMPORTED_MODULE_17__.PolygonWireOffsetContext();
-        return context.constructPolygonWireXYOffset(points, wrap, offsetDistance);
+        return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);
     }
     /**
      * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
      * * The construction will remove "some" local effects of features smaller than the offset distance, but will
      * not detect self intersection among widely separated edges.
      * * If offsetDistance is given as a number, default OffsetOptions are applied.
-     * * When the offset needs to do an "outside" turn, the first applicable construction is applied:
-     *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.
-     *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to
-     * single intersection point.
-     *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight
-     * lines that are:
-     *      * outside the arc
-     *      * have uniform turn angle less than `options.maxChamferDegrees`
-     *      * each line segment (except first and last) touches the arc at its midpoint.
+     * * See [[JointOptions]] class doc for offset construction rules.
      * @param curves base curves.
      * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
      */
@@ -195187,12 +195345,16 @@ class StrokeOptions {
     get needNormals() {
         return this._needNormals !== undefined ? this._needNormals : false;
     }
-    set needNormals(value) { this._needNormals = value; }
+    set needNormals(value) {
+        this._needNormals = value;
+    }
     /** Whether twoSided is requested. */
     get needTwoSided() {
         return this._needTwoSided !== undefined ? this._needTwoSided : false;
     }
-    set needTwoSided(value) { this._needTwoSided = value; }
+    set needTwoSided(value) {
+        this._needTwoSided = value;
+    }
     /** Ask if angleTol is specified */
     get hasAngleTol() {
         return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;
@@ -196911,7 +197073,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /**
- * Classification of contortions at a joint.
+ * Classification of how the joint is constructed.
  * @internal
  */
 var JointMode;
@@ -196924,26 +197086,44 @@ var JointMode;
     JointMode[JointMode["Gap"] = 4] = "Gap";
 })(JointMode || (JointMode = {}));
 /**
- * * Control parameters for joint construction.
- * * Decision order is:
- *   * if turn angle is greater than minArcDegrees, make an arc.
- *   * if turn angle is less than or equal maxChamferTurnDegrees, extend curves along tangent to single intersection point.
- *   * if turn angle is greater than maxChamferTurnDegrees,  construct multiple lines that are tangent to the turn circle "from the outside",
- *           with each equal turn less than maxChamferTurnDegrees.
- *   * otherwise make single edge.
+ * Control parameters for joint construction.
+ *   * Define a "joint" as the common point between adjacent segments of the input curve.
+ *   * Define the "turn angle" at a joint to be the angle in [0,pi] between the first derivatives (tangents) of
+ * the segments at the joint.
+ *   * When creating offsets, if an offset needs to do an "outside" turn, the first applicable construction is applied:
+ *   * If the turn angle is larger than `options.minArcDegrees`, a circular arc is constructed to offset the joint.
+ *   * If the turn angle is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to
+ * single intersection point (to create a sharp corner).
+ *   * If the turn angle is larger than `options.maxChamferDegrees`, the joint is offset with a line string whose edges:
+ *      * lie outside the arc that would have been created by the first construction
+ *      * have uniform turn angle less than `options.maxChamferDegrees`
+ *      * touch the arc at their midpoint (except first and last edge).
  * @public
  */
 class JointOptions {
-    /** Construct JointOptions.
+    /**
+     * Construct JointOptions.
      * * leftOffsetDistance is required
      * * minArcDegrees and maxChamferDegrees are optional.
      */
-    constructor(leftOffsetDistance, minArcDegrees = 180, maxChamferDegrees = 90, preserveEllipticalArcs = false) {
-        /** smallest arc to construct.
-         * * If this control angle is large, arcs are never created.
+    constructor(leftOffsetDistance, minArcDegrees = 180, maxChamferDegrees = 90, preserveEllipticalArcs = false, allowSharpestCorners = false) {
+        /**
+         * Smallest arc to construct.
+         * * If this control angle is 180 degrees or more, arcs are never created.
          */
         this.minArcDegrees = 180.0;
+        /** Largest turn angle at which to construct a sharp corner, or largest turn angle in a multi-segment chamfer. */
         this.maxChamferTurnDegrees = 90;
+        /**
+         * Whether to remove the internal turn angle upper bound for sharp corner construction.
+         * * By default, a sharp corner is not created at a joint when the turn angle is too large, so as to avoid offsets whose
+         *  ranges blow up. Internally, this is implemented by applying an upper bound of 120 degrees to `maxChamferTurnDegrees`.
+         * * When `allowSharpestCorners` is true, this internal upper bound is removed, allowing sharp corners for turn angles
+         * up to `maxChamferTurnDegrees`.
+         * * Thus, if you know your input turn angles are no greater than `maxChamferTurnDegrees`, you can create an offset
+         * with sharp corners at each joint by setting `minArcDegrees` to 180 and `allowSharpestCorners` to true.
+         */
+        this.allowSharpestCorners = false;
         /** Offset distance, positive to left of base curve. */
         this.leftOffsetDistance = 0;
         /** Whether to offset elliptical arcs as elliptical arcs (true) or as B-spline curves (false, default). */
@@ -196952,10 +197132,11 @@ class JointOptions {
         this.minArcDegrees = minArcDegrees;
         this.maxChamferTurnDegrees = maxChamferDegrees;
         this.preserveEllipticalArcs = preserveEllipticalArcs;
+        this.allowSharpestCorners = allowSharpestCorners;
     }
     /** Return a deep clone. */
     clone() {
-        return new JointOptions(this.leftOffsetDistance, this.minArcDegrees, this.maxChamferTurnDegrees, this.preserveEllipticalArcs);
+        return new JointOptions(this.leftOffsetDistance, this.minArcDegrees, this.maxChamferTurnDegrees, this.preserveEllipticalArcs, this.allowSharpestCorners);
     }
     /** Copy values of input options */
     setFrom(other) {
@@ -196963,6 +197144,7 @@ class JointOptions {
         this.minArcDegrees = other.minArcDegrees;
         this.maxChamferTurnDegrees = other.maxChamferTurnDegrees;
         this.preserveEllipticalArcs = other.preserveEllipticalArcs;
+        this.allowSharpestCorners = other.allowSharpestCorners;
     }
     /**
      * Parse a number or JointOptions up to JointOptions:
@@ -196973,17 +197155,22 @@ class JointOptions {
     static create(leftOffsetDistanceOrOptions) {
         if (leftOffsetDistanceOrOptions instanceof JointOptions)
             return leftOffsetDistanceOrOptions;
-        // if (Number.isFinite(leftOffsetDistanceOrOptions))
         return new JointOptions(leftOffsetDistanceOrOptions);
     }
-    /** return true if the options indicate this amount of turn should be handled with an arc. */
+    /**
+     /** Return true if the options indicate this amount of turn should be handled with an arc. */
     needArc(theta) {
         return Math.abs(theta.degrees) >= this.minArcDegrees;
     }
-    /** Test if turn by theta should be output as single point. */
+    /** Return the number of corners needed to chamfer the given turn angle. */
     numChamferPoints(theta) {
         const degrees = Math.abs(theta.degrees);
-        const stepDegrees = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.clamp(this.maxChamferTurnDegrees, 10, 120);
+        const minStepDegreesClamp = 10;
+        let maxStepDegreesClamp = 120;
+        if (this.allowSharpestCorners) {
+            maxStepDegreesClamp = this.maxChamferTurnDegrees;
+        }
+        const stepDegrees = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.clamp(this.maxChamferTurnDegrees, minStepDegreesClamp, maxStepDegreesClamp);
         if (degrees <= stepDegrees)
             return 1;
         return Math.ceil(degrees / stepDegrees);
@@ -196999,17 +197186,41 @@ class OffsetOptions {
         this.jointOptions = JointOptions.create(offsetDistanceOrOptions);
         this.strokeOptions = (strokeOptions !== undefined) ? strokeOptions : _StrokeOptions__WEBPACK_IMPORTED_MODULE_1__.StrokeOptions.createForCurves();
     }
-    get minArcDegrees() { return this.jointOptions.minArcDegrees; }
-    set minArcDegrees(value) { this.jointOptions.minArcDegrees = value; }
-    get maxChamferTurnDegrees() { return this.jointOptions.maxChamferTurnDegrees; }
-    set maxChamferTurnDegrees(value) { this.jointOptions.maxChamferTurnDegrees = value; }
-    get leftOffsetDistance() { return this.jointOptions.leftOffsetDistance; }
-    set leftOffsetDistance(value) { this.jointOptions.leftOffsetDistance = value; }
-    get preserveEllipticalArcs() { return this.jointOptions.preserveEllipticalArcs; }
-    set preserveEllipticalArcs(value) { this.jointOptions.preserveEllipticalArcs = value; }
-    /** Convert variant input into OffsetOptions.
+    get minArcDegrees() {
+        return this.jointOptions.minArcDegrees;
+    }
+    set minArcDegrees(value) {
+        this.jointOptions.minArcDegrees = value;
+    }
+    get maxChamferTurnDegrees() {
+        return this.jointOptions.maxChamferTurnDegrees;
+    }
+    set maxChamferTurnDegrees(value) {
+        this.jointOptions.maxChamferTurnDegrees = value;
+    }
+    get allowSharpestCorners() {
+        return this.jointOptions.allowSharpestCorners;
+    }
+    set allowSharpestCorners(value) {
+        this.jointOptions.allowSharpestCorners = value;
+    }
+    get leftOffsetDistance() {
+        return this.jointOptions.leftOffsetDistance;
+    }
+    set leftOffsetDistance(value) {
+        this.jointOptions.leftOffsetDistance = value;
+    }
+    get preserveEllipticalArcs() {
+        return this.jointOptions.preserveEllipticalArcs;
+    }
+    set preserveEllipticalArcs(value) {
+        this.jointOptions.preserveEllipticalArcs = value;
+    }
+    /**
+     * Convert variant input into OffsetOptions.
      * * If a JointOptions is provided, it is captured.
-     * * If an OffsetOptions is provided, a reference to it is returned. */
+     * * If an OffsetOptions is provided, a reference to it is returned.
+     */
     static create(offsetDistanceOrOptions) {
         if (offsetDistanceOrOptions instanceof OffsetOptions)
             return offsetDistanceOrOptions;
@@ -197038,7 +197249,9 @@ class Joint {
         this.swingPoint = swingPoint;
         this.flexure = JointMode.Unknown;
     }
-    /** try to construct an arc transition from ray0 to ray1 with given center. */
+    /**
+     * Try to construct an arc transition from ray0 to ray1 with given center.
+     */
     static constructArc(ray0, center, ray1) {
         if (center !== undefined && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(ray0.origin.distance(center), ray1.origin.distance(center))) {
             const angle = ray0.direction.angleToXY(ray1.direction);
@@ -197083,6 +197296,7 @@ class Joint {
                 destination.packedPoints.push(point);
         }
     }
+    /** Append stroke points along the offset curve defined by the Joint chain to the destination line string. */
     static collectStrokesFromChain(start, destination, maxTest = 100) {
         let numOut = -2 * maxTest; // allow extra things to happen
         Joint.visitJointsOnChain(start, (joint) => {
@@ -197094,7 +197308,7 @@ class Joint {
                 if (fA === 0.0 && fB === 1.0)
                     curve1 = joint.curve1.clone();
                 else if (fA < fB)
-                    curve1 = joint.curve1.clonePartialCurve(fA, fB);
+                    curve1 = joint.curve1.clonePartialCurve(fA, fB); // trimming is done by clonePartialCurve
                 if (curve1) {
                     if (!joint.jointCurve) {
                         this.addPoint(destination, curve1.startPoint());
@@ -197134,6 +197348,7 @@ class Joint {
             }
         }
     }
+    /** Append CurvePrimitives along the offset curve defined by the Joint chain to the destination array. */
     static collectCurvesFromChain(start, destination, maxTest = 100) {
         if (start === undefined)
             return;
@@ -197148,13 +197363,13 @@ class Joint {
                 if (fA === 0.0 && fB === 1.0)
                     curve1 = joint.curve1.clone();
                 else if (fA < fB)
-                    curve1 = joint.curve1.clonePartialCurve(fA, fB);
+                    curve1 = joint.curve1.clonePartialCurve(fA, fB); // trimming is done by clonePartialCurve
                 this.collectPrimitive(destination, curve1);
             }
             return numOut++ < maxTest;
         }, maxTest);
     }
-    /** Execute `joint.annotateJointMode()` at all joints on the chain. */
+    /** Execute `joint.annotateJointMode()` at all joints on the chain to set some of the joints attributes. */
     static annotateChain(start, options, maxTest = 100) {
         if (start)
             Joint.visitJointsOnChain(start, (joint) => { joint.annotateJointMode(options); return true; }, maxTest);
@@ -197162,7 +197377,7 @@ class Joint {
     /**
      * Visit joints on a chain.
      * * terminate on `false` return from `callback`
-     * @param start first (and, for cyclic chain, final) Joint
+     * @param start first (and, for cyclic chain, final) joint
      * @param callback function to call with each Joint as a single parameter.
      */
     static visitJointsOnChain(start, callback, maxTest = 100) {
@@ -197170,7 +197385,7 @@ class Joint {
         if (joint) {
             let numTest = 0;
             while (joint !== undefined) {
-                if (numTest++ >= maxTest + 5)
+                if (numTest++ >= maxTest + 5) // allow extra things to happen
                     return true;
                 if (!callback(joint))
                     return false;
@@ -197186,13 +197401,13 @@ class Joint {
         if (this.curve0 && this.curve1) {
             const ray0 = this.curve0.fractionToPointAndDerivative(1.0);
             const ray1 = this.curve1.fractionToPointAndDerivative(0.0);
-            const intersection = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.closestApproachRay3dRay3d(ray0, ray1);
+            const intersection = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.closestApproachRay3dRay3d(ray0, ray1); // intersection of the 2 ray lines
             if (intersection.approachType === _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveCurveApproachType.Intersection) {
                 if (intersection.detailA.fraction >= 0.0 && intersection.detailB.fraction <= 0.0) {
                     this.fraction0 = 1.0;
                     this.fraction1 = 0.0;
                     this.flexure = JointMode.Extend;
-                    const theta = ray0.getDirectionRef().angleToXY(ray1.getDirectionRef());
+                    const theta = ray0.getDirectionRef().angleToXY(ray1.getDirectionRef()); // angle between the 2 ray lines
                     if (options.needArc(theta)) {
                         const arc = Joint.constructArc(ray0, this.curve0.baseCurveEnd, ray1);
                         if (arc) {
@@ -197200,13 +197415,12 @@ class Joint {
                             return;
                         }
                     }
-                    const numChamferPoints = options.numChamferPoints(theta);
-                    if (numChamferPoints <= 1) {
+                    const numChamferPoints = options.numChamferPoints(theta); // how many interior points in the linestring
+                    if (numChamferPoints <= 1) { // create sharp corner
                         this.jointCurve = _LineString3d__WEBPACK_IMPORTED_MODULE_6__.LineString3d.create(ray0.origin, intersection.detailA.point, ray1.origin);
                         return;
                     }
-                    if (numChamferPoints > 1) {
-                        // A nontrivial linestring ...
+                    if (numChamferPoints > 1) { // create chamfer corner (a line string)
                         const radians0 = theta.radians;
                         const numHalfStep = 2.0 * numChamferPoints;
                         const halfStepRadians = radians0 / numHalfStep;
@@ -197226,19 +197440,20 @@ class Joint {
                     }
                 }
             }
-            // desperation appears ...
+            // if there is no intersection between the 2 ray lines, fill the gap by a line segment
             this.flexure = JointMode.Gap;
             this.jointCurve = _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d.create(this.curve0.fractionToPoint(1.0), this.curve1.fractionToPoint(0.0));
             this.fraction0 = 1.0;
             this.fraction1 = 0.0;
         }
     }
-    // Select the index at which summed fraction difference is smallest.
+    /** Select the index at which summed fraction difference is smallest */
     selectIntersectionIndexByFraction(fractionA, fractionB, intersections) {
         let index = -1;
         let aMin = Number.MAX_VALUE;
         for (let i = 0; i < intersections.length; i++) {
-            const a = Math.abs(intersections[i].detailA.fraction - fractionA) + Math.abs(intersections[i].detailB.fraction - fractionB);
+            const a = Math.abs(intersections[i].detailA.fraction - fractionA)
+                + Math.abs(intersections[i].detailB.fraction - fractionB);
             if (a < aMin) {
                 aMin = a;
                 index = i;
@@ -197247,42 +197462,42 @@ class Joint {
         return index;
     }
     /**
-     * Examine the adjacent geometry
-     * * set JointMode:  one of Cap Extend, or Trim
+     * Examine the adjacent geometry to set some of joint attributes:
+     * * set JointMode: one of Cap, Extend, or Trim
      * * set fraction0 and fraction1 of intersection of curve0 and curve1
+     * * set joint curve
      * * this REFERENCES curve0, curve1, fraction0, fraction1
      * * this does not reference nextJoint and previousJoint
      */
     annotateJointMode(options) {
-        if (this.curve0 && !this.curve1) {
+        if (!this.curve0 && this.curve1) { // joint at the start of the chain
             this.flexure = JointMode.Cap;
-            this.fraction0 = 1.0;
+            this.fraction1 = 0.0;
         }
-        else if (this.curve1 && !this.curve0) {
+        else if (this.curve0 && !this.curve1) { // joint at the end of the chain
             this.flexure = JointMode.Cap;
-            this.fraction1 = 0.0;
+            this.fraction0 = 1.0;
         }
-        else if (this.curve0 && this.curve1) {
-            // check for direct intersection -- occurs on offset of colinear base segments, and closed primitives
-            if (this.curve0.endPoint().isAlmostEqual(this.curve1.startPoint())) {
+        else if (this.curve0 && this.curve1) { // joints at the middle of the chain
+            if (this.curve0.endPoint().isAlmostEqual(this.curve1.startPoint())) { // joint between colinear segments
                 this.fraction0 = 1.0;
                 this.fraction1 = 0.0;
                 this.flexure = JointMode.Trim;
             }
-            else if (this.curve0 instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d && this.curve1 instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d) {
-                const ray0 = this.curve0.fractionToPointAndDerivative(0.0); // And we know that is full length ray !
-                const ray1 = this.curve1.fractionToPointAndDerivative(0.0); // ditto
-                const intersection = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.closestApproachRay3dRay3d(ray0, ray1);
+            else if (this.curve0 instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d && this.curve1 instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d) { // pair of lines
+                const ray0 = this.curve0.fractionToPointAndDerivative(0.0);
+                const ray1 = this.curve1.fractionToPointAndDerivative(0.0);
+                const intersection = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.closestApproachRay3dRay3d(ray0, ray1); // intersection of the 2 ray lines
                 if (intersection.approachType === _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveCurveApproachType.Intersection) {
                     this.fraction0 = intersection.detailA.fraction;
                     this.fraction1 = intersection.detailB.fraction;
-                    if (this.fraction0 >= 1.0 && this.fraction1 <= 0.0) {
+                    if (this.fraction0 >= 1.0 && this.fraction1 <= 0.0) { // need to extend
                         this.annotateExtension(options);
                     }
-                    else if (this.fraction0 < 1.0 && this.fraction1 > 0.0) {
+                    else if (this.fraction0 < 1.0 && this.fraction1 > 0.0) { // need to trim
                         this.flexure = JointMode.Trim;
                     }
-                    else if (this.fraction0 > 1.0 && this.fraction1 > 1.0) {
+                    else if (this.fraction0 > 1.0 && this.fraction1 > 1.0) { // need to fill gap with a single line segment
                         this.flexure = JointMode.Gap;
                         this.jointCurve = _LineSegment3d__WEBPACK_IMPORTED_MODULE_5__.LineSegment3d.create(this.curve0.fractionToPoint(1.0), this.curve1.fractionToPoint(0.0));
                         this.fraction0 = 1.0;
@@ -197290,15 +197505,15 @@ class Joint {
                     }
                 }
             }
-            else { // generic pair of curves ...
+            else { // generic pair of curves
                 const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_9__.CurveCurve.intersectionXYPairs(this.curve0, false, this.curve1, false);
                 const intersectionIndex = this.selectIntersectionIndexByFraction(1.0, 0.0, intersections);
-                if (intersectionIndex >= 0) {
+                if (intersectionIndex >= 0) { // need to trim
                     this.flexure = JointMode.Trim;
                     this.fraction0 = intersections[intersectionIndex].detailA.fraction;
                     this.fraction1 = intersections[intersectionIndex].detailB.fraction;
                 }
-                else {
+                else { // need to extend
                     this.annotateExtension(options);
                 }
             }
@@ -197306,7 +197521,8 @@ class Joint {
     }
     /**
      * * Examine the primitive trim fractions between each pair of joints.
-     * * If trim fractions indicate the primitive must disappear, replace the joint pair by a new joint pointing at surrounding primitives
+     * * If trim fractions indicate the primitive must disappear, replace the joint pair by a new joint pointing at
+     * surrounding primitives
      * @param start
      */
     static removeDegeneratePrimitives(start, options, maxTest) {
@@ -197341,8 +197557,7 @@ class Joint {
                       }
                     */
                     const eliminateF = f0 >= f1 || f0 > 1.0;
-                    const eliminateG = (g0 !== undefined && g0 > 1.0)
-                        || (g0 !== undefined && g1 !== undefined && g0 >= g1);
+                    const eliminateG = (g0 !== undefined && g0 > 1.0) || (g0 !== undefined && g1 !== undefined && g0 >= g1);
                     if (eliminateF && eliminateG) {
                         const jointC = jointB.nextJoint;
                         const newJoint = new Joint(jointA.curve0, jointC.curve1, undefined);
@@ -197398,9 +197613,8 @@ class Joint {
  * @internal
  */
 class PolygonWireOffsetContext {
-    /** construct a context. */
-    constructor() {
-    }
+    /** Construct a context. */
+    constructor() { }
     // Construct a single offset from base points
     static createOffsetSegment(basePointA, basePointB, distance) {
         _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createStartEnd(basePointA, basePointB, this._unitAlong);
@@ -197413,13 +197627,25 @@ class PolygonWireOffsetContext {
         return undefined;
     }
     /**
-     * Construct curves that are offset from a polygon.
-     * * The construction will remove "some" local effects of features smaller than the offset distance, but will not detect self intersection with far-away edges.
-     * @param points
-     * @param wrap
-     * @param offsetDistance
+     * Construct a wire (not area) that is offset from given polyline or polygon (which must be in xy-plane or in
+     *  a plane parallel to xy-plane).
+     * * This is a simple wire offset (in the form of a line string), not an area.
+     * * If offsetDistance is given as a number, default OffsetOptions are applied.
+     * * See [[JointOptions]] class doc for offset construction rules.
+     * @param points a single loop or path
+     * @param wrap true to offset the wraparound joint. Assumes first = last point.
+     * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions
+     * object.
      */
     constructPolygonWireXYOffset(points, wrap, leftOffsetDistanceOrOptions) {
+        /**
+         * if "wrap = true", then first and last point in the points array must be close; otherwise
+         * generated offset will be invalid.
+         */
+        if (wrap && !points[0].isAlmostEqual(points[points.length - 1])) {
+            wrap = false;
+        }
+        /** create raw offsets as a linked list (joint0) */
         const options = JointOptions.create(leftOffsetDistanceOrOptions);
         const numPoints = points.length;
         let fragment0 = PolygonWireOffsetContext.createOffsetSegment(points[0], points[1], options.leftOffsetDistance);
@@ -197439,7 +197665,9 @@ class PolygonWireOffsetContext {
             newJoint = new Joint(fragment0, undefined, points[numPoints - 1]);
             Joint.link(previousJoint, newJoint);
         }
+        /** annotateChain sets some of the joints attributes (including how to extend curves or fill the gap between curves) */
         Joint.annotateChain(joint0, options, numPoints);
+        /** make limited passes through the Joint chain until no self-intersections are removed */
         for (let pass = 0; pass++ < 5;) {
             const state = Joint.removeDegeneratePrimitives(joint0, options, numPoints);
             joint0 = state.newStart;
@@ -197453,6 +197681,7 @@ class PolygonWireOffsetContext {
             */
         }
         // Joint.collectPrimitivesFromChain(joint0, result, numPoints);
+        /** turn the Joint linked list into a CurveCollection (Loop or Path). trimming is done in collectStrokesFromChain */
         const chain = _LineString3d__WEBPACK_IMPORTED_MODULE_6__.LineString3d.create();
         Joint.collectStrokesFromChain(joint0, chain, numPoints);
         const n = chain.packedPoints.length;
@@ -197476,14 +197705,13 @@ PolygonWireOffsetContext._offsetB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTE
  */
 class CurveChainWireOffsetContext {
     /** construct a context. */
-    constructor() {
-    }
+    constructor() { }
     /**
      * Annotate a CurvePrimitive with properties `baseCurveStart` and `baseCurveEnd`.
-     * * return cp
-     * @param cp primitive to annotate
+     * @param cp curve primitive to annotate
      * @param startPoint optional start point
      * @param endPoint optional end point
+     * @return the input CurvePrimitive with annotations
      */
     static applyBasePoints(cp, startPoint, endPoint) {
         if (cp !== undefined) {
@@ -197495,7 +197723,7 @@ class CurveChainWireOffsetContext {
         return cp;
     }
     /**
-     * Create the offset of a single primitive.
+     * Create the offset of a single primitive as viewed in the xy-plane (ignoring z).
      * * each primitive may be labeled (as an `any` object) with start or end point of base curve:
      *   * `(primitive as any).baseCurveStart: Point3d`
      *   * `(primitive as any).baseCurveEnd: Point3d`
@@ -197519,15 +197747,10 @@ class CurveChainWireOffsetContext {
     }
     /**
      * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
-     * * The construction will remove "some" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.
+     * * The construction will remove "some" local effects of features smaller than the offset distance, but will
+     * not detect self intersection among widely separated edges.
      * * If offsetDistance is given as a number, default OffsetOptions are applied.
-     * * When the offset needs to do an "outside" turn, the first applicable construction is applied:
-     *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.
-     *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to single intersection point.
-     *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight lines that are:
-     *      * outside the arc
-     *      * have uniform turn angle less than `options.maxChamferDegrees`
-     *      * each line segment (except first and last) touches the arc at its midpoint.
+     * * See [[JointOptions]] class doc for offset construction rules.
      * @param curves base curves.
      * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
      */
@@ -197535,14 +197758,15 @@ class CurveChainWireOffsetContext {
         const wrap = curves instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop;
         const offsetOptions = OffsetOptions.create(offsetDistanceOrOptions);
         const simpleOffsets = [];
-        // setup pass: get simple offsets of each primitive
+        /** traverse primitives (children of curves) and create simple offsets of each primitive as an array */
         for (const c of curves.children) {
             const c1 = CurveChainWireOffsetContext.createSingleOffsetPrimitiveXY(c, offsetOptions);
             if (c1 === undefined) {
                 // bad .. maybe arc to inside?
             }
-            else if (c1 instanceof _CurvePrimitive__WEBPACK_IMPORTED_MODULE_12__.CurvePrimitive)
+            else if (c1 instanceof _CurvePrimitive__WEBPACK_IMPORTED_MODULE_12__.CurvePrimitive) {
                 simpleOffsets.push(c1);
+            }
             else if (Array.isArray(c1)) {
                 for (const c2 of c1) {
                     if (c2 instanceof _CurvePrimitive__WEBPACK_IMPORTED_MODULE_12__.CurvePrimitive)
@@ -197550,6 +197774,7 @@ class CurveChainWireOffsetContext {
                 }
             }
         }
+        /** create joints between array elements to make offsets as a linked list (joint0) */
         let fragment0;
         let newJoint;
         let previousJoint;
@@ -197568,8 +197793,10 @@ class CurveChainWireOffsetContext {
         }
         if (joint0 && previousJoint && curves instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop)
             Joint.link(previousJoint, joint0);
+        /** annotateChain sets some of the joints attributes (including how to extend curves or fill the gap between curves) */
         const numOffset = simpleOffsets.length;
         Joint.annotateChain(joint0, offsetOptions.jointOptions, numOffset);
+        /** turn the Joint linked list into a CurveCollection. trimming is done in collectCurvesFromChain */
         const outputCurves = [];
         Joint.collectCurvesFromChain(joint0, outputCurves, numOffset);
         return _RegionOps__WEBPACK_IMPORTED_MODULE_13__.RegionOps.createLoopPathOrBagOfCurves(outputCurves, wrap, true);
@@ -210256,10 +210483,12 @@ __webpack_require__.r(__webpack_exports__);
  *   * are NOT required to be unit vectors.
  *   * are NOT required to be perpendicular vectors.
  * * The skewed, non-uniform scaling of the grid directions is the primary focus of this class.
- * * Queries of altitude, velocity, normalX, normalY, and normalZ use the NORMALIZED cross product of vectorU and vectorV as plane normal.
+ * * Queries of altitude, velocity, normalX, normalY, and normalZ use the NORMALIZED cross product of vectorU
+ * and vectorV as plane normal.
  *   * Hence these are cartesian distances.
  *   * If numerous calls to these are expected, the repeated normalization may be a performance issue.
- *   * Using a [[Plane3dByOriginAndUnitNormal]] or the rigid transform returned by [[toRigidFrame]] would provide better performance.
+ *   * Using a [[Plane3dByOriginAndUnitNormal]] or the rigid transform returned by [[toRigidFrame]] would provide
+ * better performance.
  * @public
  */
 class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d {
@@ -210269,7 +210498,7 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
         this.vectorU = vectorU;
         this.vectorV = vectorV;
     }
-    /** create a new plane from origin and 2 in-plane vectors. */
+    /** Create a new plane from origin and 2 in-plane vectors. */
     static createOriginAndVectors(origin, vectorU, vectorV, result) {
         if (result) {
             result.origin.setFrom(origin);
@@ -210279,13 +210508,14 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
         }
         return new Plane3dByOriginAndVectors(origin.clone(), vectorU.clone(), vectorV.clone());
     }
-    /** clone to a new plane. */
+    /** Clone to a new plane. */
     clone(result) {
         if (result !== undefined)
             result.setOriginAndVectors(this.origin, this.vectorU, this.vectorV);
         return new Plane3dByOriginAndVectors(this.origin.clone(), this.vectorU.clone(), this.vectorV.clone());
     }
-    /** create a new Plane3dByOriginAndVectors from a variety of plane types.
+    /**
+     * Create a new Plane3dByOriginAndVectors from a variety of plane types.
      * * The input is NOT captured.
      */
     static createFrom(source, result) {
@@ -210344,7 +210574,8 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
         this.vectorV.set(vx, vy, vz);
         return this;
     }
-    /** Set all origin and both vectors from coordinates in given origin and vectors.
+    /**
+     * Set all origin and both vectors from coordinates in given origin and vectors.
      * * Note that coordinates are copied out of the parameters -- the given parameters are NOT retained by reference.
      */
     setOriginAndVectors(origin, vectorU, vectorV) {
@@ -210359,7 +210590,8 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
             return result.setOriginAndVectorsXYZ(x0, y0, z0, ux, uy, uz, vx, vy, vz);
         return new Plane3dByOriginAndVectors(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x0, y0, z0), _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(ux, uy, uz), _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(vx, vy, vz));
     }
-    /** Define a plane by three points in the plane.
+    /**
+     * Define a plane by three points in the plane.
      * @param origin origin for the parameterization.
      * @param targetU target point for the vectorU starting at the origin.
      * @param targetV target point for the vectorV originating at the origin.
@@ -210372,7 +210604,8 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     static createXYPlane(result) {
         return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(0, 0, 0, 1, 0, 0, 0, 1, 0, result);
     }
-    /** create a plane from data presented as Float64Arrays.
+    /**
+     * Create a plane from data presented as Float64Arrays.
      * @param origin x,y,z of origin.
      * @param vectorU x,y,z of vectorU
      * @param vectorV x,y,z of vectorV
@@ -210380,7 +210613,8 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     static createOriginAndVectorsArrays(origin, vectorU, vectorV, result) {
         return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(origin[0], origin[1], origin[2], vectorU[0], vectorU[1], vectorU[2], vectorV[0], vectorV[1], vectorV[2], result);
     }
-    /** create a plane from data presented as Float64Array with weights
+    /**
+     * Create a plane from data presented as Float64Array with weights
      * @param origin x,y,z,w of origin.
      * @param vectorU x,y,z,w of vectorU
      * @param vectorV x,y,z,w of vectorV
@@ -210444,7 +210678,7 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
             vectorV: this.vectorV.toJSON(),
         };
     }
-    /** create a new plane.   See `setFromJSON` for layout example. */
+    /** Create a new plane.   See `setFromJSON` for layout example. */
     static fromJSON(json) {
         const result = Plane3dByOriginAndVectors.createXYPlane();
         result.setFromJSON(json);
@@ -210456,7 +210690,8 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
             && this.vectorU.isAlmostEqual(other.vectorU)
             && this.vectorV.isAlmostEqual(other.vectorV);
     }
-    /** Normalize both `vectorU` and `vectorV` in place.  This does NOT make them perpendicular.
+    /**
+     * Normalize both `vectorU` and `vectorV` in place. This does NOT make them perpendicular.
      * * Return true if both succeeded.
      */
     normalizeInPlace() {
@@ -210464,9 +210699,7 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
         const okV = this.vectorV.normalizeInPlace();
         return okU && okV;
     }
-    /**
-     * Return (if possible) a unit normal to the plane.
-     */
+    /** Return (if possible) a unit normal to the plane */
     getUnitNormal(result) {
         return this.vectorU.unitCrossProduct(this.vectorV, result);
     }
@@ -210483,9 +210716,7 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     getAnyPointOnPlane(result) {
         return this.origin.clone(result);
     }
-    /**
-     * Return (if possible) a ray with origin at plane origin, direction as unit normal to the plane.
-     */
+    /** Return (if possible) a ray with origin at plane origin, direction as unit normal to the plane */
     unitNormalRay(result) {
         if (!Plane3dByOriginAndVectors._workVector)
             Plane3dByOriginAndVectors._workVector = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create();
@@ -210505,27 +210736,24 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     toRigidFrame(result) {
         return _Transform__WEBPACK_IMPORTED_MODULE_5__.Transform.createRigidFromOriginAndColumns(this.origin, this.vectorU, this.vectorV, _Geometry__WEBPACK_IMPORTED_MODULE_3__.AxisOrder.XYZ, result);
     }
-    /**
-     * Apply the transform to the origin and vectors in place.
-     */
+    /** Apply the transform to the origin and vectors in place */
     transformInPlace(transform) {
         transform.multiplyPoint3d(this.origin, this.origin);
         transform.multiplyVector(this.vectorU, this.vectorU);
         transform.multiplyVector(this.vectorV, this.vectorV);
     }
-    // Implement PlaneAltitudeEvaluator methods . . .
     /**
      * Return x component of the (normalized!) {vectorU CROSS vectorV}.
      * Return 0 if the cross product is zero.
-     * */
+     */
     normalX() {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         return unitNormal !== undefined ? unitNormal.x : 0.0;
     }
     /**
-  * Return y component of the (normalized!) {vectorU CROSS vectorV}.
-  * Return 0 if the cross product is zero.
-  * */
+     * Return y component of the (normalized!) {vectorU CROSS vectorV}.
+     * Return 0 if the cross product is zero.
+     */
     normalY() {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         return unitNormal !== undefined ? unitNormal.y : 0.0;
@@ -210533,41 +210761,43 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     /**
      * Return z component of the (normalized!) {vectorU CROSS vectorV}.
      * Return 0 if the cross product is zero.
-     * */
+     */
     normalZ() {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         return unitNormal !== undefined ? unitNormal.z : 0.0;
     }
-    /** Return signed cartesian altitude perpendicular to the plane.  This uses the normalized cross product as normal. */
+    /** Return signed cartesian altitude perpendicular to the plane. This uses the normalized cross product as normal. */
     altitude(xyz) {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         if (unitNormal === undefined)
             return 0.0;
         return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYZXYZ((xyz.x - this.origin.x), (xyz.y - this.origin.y), (xyz.z - this.origin.z), unitNormal.x, unitNormal.y, unitNormal.z);
     }
-    /** Return signed cartesian altitude perpendicular to the plane.  This uses the normalized cross product as normal. */
+    /** Return signed cartesian altitude perpendicular to the plane. This uses the normalized cross product as normal. */
     altitudeXYZ(x, y, z) {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         if (unitNormal === undefined)
             return 0.0;
         return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYZXYZ((x - this.origin.x), (y - this.origin.y), (z - this.origin.z), unitNormal.x, unitNormal.y, unitNormal.z);
     }
-    /** Return signed projection of the input vector to the plane normal.  This uses the normalized cross product as normal. */
+    /** Return signed projection of the input vector to the plane normal. This uses the normalized cross product as normal. */
     velocity(xyzVector) {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         if (unitNormal === undefined)
             return 0.0;
         return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYZXYZ(xyzVector.x, xyzVector.y, xyzVector.z, unitNormal.x, unitNormal.y, unitNormal.z);
     }
-    /** Return signed projection of the input vector to the plane normal.  This uses the normalized cross product as normal. */
+    /** Return signed projection of the input vector to the plane normal. This uses the normalized cross product as normal. */
     velocityXYZ(x, y, z) {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         if (unitNormal === undefined)
             return 0.0;
         return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYZXYZ(x, y, z, unitNormal.x, unitNormal.y, unitNormal.z);
     }
-    /** Return triple product of homogeneous difference {(xyzw - w * origin)} with vectorU and vectorV.
-     * * In the usual manner of homogeneous calculations, this is proportional to true cartesian distance from the plane but is not a physical distance.
+    /**
+     * Return triple product of homogeneous difference {(xyzw - w * origin)} with vectorU and vectorV.
+     * * In the usual manner of homogeneous calculations, this is proportional to true cartesian distance from the
+     * plane but is not a physical distance.
      */
     weightedAltitude(xyzw) {
         const w = xyzw.w;
@@ -216737,7 +216967,7 @@ class Range3d extends RangeBase {
         const coffs = transform.matrix.coffs;
         this.extendXYZW(origin.x * w + coffs[0] * x + coffs[1] * y + coffs[2] * z, origin.y * w + coffs[3] * x + coffs[4] * y + coffs[5] * z, origin.z * w + coffs[6] * x + coffs[7] * y + coffs[8] * z, w);
     }
-    /** Multiply the point x,y,z by transform and use the coordinate to extend this range. */
+    /** Multiply the point x,y,z by the inverse of the transform and use the coordinate to extend this range. */
     extendInverseTransformedXYZ(transform, x, y, z) {
         const origin = transform.origin;
         if (!transform.matrix.computeCachedInverse(true))
@@ -276918,7 +277148,7 @@ class TestContext {
         this.initializeRpcInterfaces({ title: this.settings.Backend.name, version: this.settings.Backend.version });
         const iModelClient = new imodels_client_management_1.IModelsClient({ api: { baseUrl: `https://${process.env.IMJS_URL_PREFIX ?? ""}api.bentley.com/imodels` } });
         await core_frontend_1.NoRenderApp.startup({
-            applicationVersion: "4.1.0-dev.25",
+            applicationVersion: "4.1.0-dev.27",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -296292,7 +296522,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.1.0-dev.25","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.1.0-dev.25","@itwin/core-bentley":"workspace:^4.1.0-dev.25","@itwin/core-common":"workspace:^4.1.0-dev.25","@itwin/core-geometry":"workspace:^4.1.0-dev.25","@itwin/core-orbitgt":"workspace:^4.1.0-dev.25","@itwin/core-quantity":"workspace:^4.1.0-dev.25"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"^4.0.0-dev.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.1.0-dev.27","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.1.0-dev.27","@itwin/core-bentley":"workspace:^4.1.0-dev.27","@itwin/core-common":"workspace:^4.1.0-dev.27","@itwin/core-geometry":"workspace:^4.1.0-dev.27","@itwin/core-orbitgt":"workspace:^4.1.0-dev.27","@itwin/core-quantity":"workspace:^4.1.0-dev.27"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"^4.0.0-dev.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ }),