@itwin/ecschema-rpcinterface-tests 5.13.1 → 5.14.0-dev.10

package/lib/dist/bundled-tests.js

@@ -22506,6 +22506,122 @@ class PerfLogger {
 }
 
 
+/***/ },
+
+/***/ "../../core/bentley/lib/esm/ObservableMap.js"
+/*!***************************************************!*\
+  !*** ../../core/bentley/lib/esm/ObservableMap.js ***!
+  \***************************************************/
+(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   ObservableMap: () => (/* binding */ ObservableMap)
+/* harmony export */ });
+/* harmony import */ var _BeEvent__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./BeEvent */ "../../core/bentley/lib/esm/BeEvent.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 Collections
+ */
+
+/** A standard [Map<K,V>](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map) that emits an event when its contents change.
+ * @public
+ */
+class ObservableMap extends Map {
+    /** @internal */
+    get [Symbol.toStringTag]() { return "ObservableMap"; }
+    /** Emitted after any change to the contents of this map. */
+    onChanged = new _BeEvent__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
+    /** Construct a new ObservableMap.
+     * @param elements Optional elements with which to populate the new map.
+     */
+    constructor(elements) {
+        // IMPORTANT: do not pass `elements` to `super()`. It will invoke `set` which is overridden to invoke `onChanged.raiseEvent`, but
+        // `onChanged` is not initialized until `super()` returns.
+        super();
+        if (elements)
+            this.setAll(elements);
+    }
+    /** Invokes [Map.set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/set), raising
+     * the [[onChanged]] event unless `key` is already present with the same `value`.
+     */
+    set(key, value) {
+        const valueChanged = !this.has(key) || !Object.is(this.get(key), value);
+        if (valueChanged)
+            super.set(key, value);
+        if (valueChanged) {
+            this.onChanged.raiseEvent();
+        }
+        return this;
+    }
+    /** Invokes [Map.delete](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/delete), raising
+     * the [[onChanged]] event if the key was removed from the map.
+     */
+    delete(key) {
+        const ret = super.delete(key);
+        if (ret) {
+            this.onChanged.raiseEvent();
+        }
+        return ret;
+    }
+    /** If this map is not already empty, invokes [Map.clear](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/clear)
+     * and raises the [[onChanged]] event.
+     */
+    clear() {
+        if (0 !== this.size) {
+            super.clear();
+            this.onChanged.raiseEvent();
+        }
+    }
+    /** Add or update multiple entries in the map, raising [[onChanged]] only once after all items are set, if the contents of
+     * the map changed as a result.
+     * This is more efficient than calling [[set]] in a loop when listeners need not be notified of each individual change.
+     * @param items The entries to add or update.
+     */
+    setAll(items) {
+        let changed = false;
+        try {
+            for (const [key, value] of items) {
+                if (!this.has(key) || !Object.is(this.get(key), value)) {
+                    super.set(key, value);
+                    changed = true;
+                }
+            }
+        }
+        finally {
+            if (changed) {
+                this.onChanged.raiseEvent();
+            }
+        }
+    }
+    /** Delete multiple keys from the map, raising [[onChanged]] only once after all keys are deleted.
+     * This is more efficient than calling [[delete]] in a loop when listeners need not be notified of each individual deletion.
+     * @param keys The keys to delete.
+     * @returns The number of keys that were actually deleted (i.e., were present in the map).
+     */
+    deleteAll(keys) {
+        const prevSize = this.size;
+        let deletedAny = false;
+        try {
+            for (const key of keys) {
+                if (super.delete(key))
+                    deletedAny = true;
+            }
+        }
+        finally {
+            if (deletedAny) {
+                this.onChanged.raiseEvent();
+            }
+        }
+        return prevSize - this.size;
+    }
+}
+
+
 /***/ },
 
 /***/ "../../core/bentley/lib/esm/ObservableSet.js"
@@ -22532,6 +22648,8 @@ __webpack_require__.r(__webpack_exports__);
  * @public
  */
 class ObservableSet extends Set {
+    /** @internal */
+    get [Symbol.toStringTag]() { return "ObservableSet"; }
     /** Emitted after `item` is added to this set. */
     onAdded = new _BeEvent__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
     /** Emitted after `item` is deleted from this set. */
@@ -22542,27 +22660,39 @@ class ObservableSet extends Set {
     onBatchAdded = new _BeEvent__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
     /** Emitted after multiple items are deleted from this set via [[deleteAll]]. */
     onBatchDeleted = new _BeEvent__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
+    /** Emitted after any change to the contents of this set. */
+    onChanged = new _BeEvent__WEBPACK_IMPORTED_MODULE_0__.BeEvent();
     /** Construct a new ObservableSet.
      * @param elements Optional elements with which to populate the new set.
      */
     constructor(elements) {
-        // NB: Set constructor will invoke add(). Do not override until initialized.
-        super(elements);
-        this.add = (item) => {
-            const prevSize = this.size;
-            const ret = super.add(item);
-            if (this.size !== prevSize)
-                this.onAdded.raiseEvent(item);
-            return ret;
-        };
+        // IMPORTANT: do not pass `elements` to `super()`. It will invoke `add` which is overridden to invoke `onAdded.raiseEvent`, but
+        // `onAdded` is not initialized until `super()` returns.
+        super();
+        if (elements)
+            this.addAll(elements);
+    }
+    /** Invokes [Set.add](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/add), raising
+     * the [[onAdded]] event if the item was not already present in the set.
+     */
+    add(item) {
+        const prevSize = this.size;
+        const ret = super.add(item);
+        if (this.size !== prevSize) {
+            this.onAdded.raiseEvent(item);
+            this.onChanged.raiseEvent();
+        }
+        return ret;
     }
     /** Invokes [Set.delete](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/delete), raising
      * the [[onDeleted]] event if the item was removed from the set.
      */
     delete(item) {
         const ret = super.delete(item);
-        if (ret)
+        if (ret) {
             this.onDeleted.raiseEvent(item);
+            this.onChanged.raiseEvent();
+        }
         return ret;
     }
     /** If this set is not already empty, invokes [Set.clear](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/clear)
@@ -22572,6 +22702,7 @@ class ObservableSet extends Set {
         if (0 !== this.size) {
             super.clear();
             this.onCleared.raiseEvent();
+            this.onChanged.raiseEvent();
         }
     }
     /** Add multiple items to the set, raising [[onBatchAdded]] only once after all items are added.
@@ -22581,10 +22712,21 @@ class ObservableSet extends Set {
      */
     addAll(items) {
         const prevSize = this.size;
-        for (const item of items)
-            super.add(item);
-        if (this.size !== prevSize)
-            this.onBatchAdded.raiseEvent();
+        let addedAny = false;
+        try {
+            for (const item of items) {
+                const prevSetSize = this.size;
+                super.add(item);
+                if (this.size !== prevSetSize)
+                    addedAny = true;
+            }
+        }
+        finally {
+            if (addedAny) {
+                this.onBatchAdded.raiseEvent();
+                this.onChanged.raiseEvent();
+            }
+        }
         return this.size - prevSize;
     }
     /** Delete multiple items from the set, raising [[onBatchDeleted]] only once after all items are deleted.
@@ -22594,10 +22736,21 @@ class ObservableSet extends Set {
      */
     deleteAll(items) {
         const prevSize = this.size;
-        for (const item of items)
-            super.delete(item);
-        if (this.size !== prevSize)
-            this.onBatchDeleted.raiseEvent();
+        let deletedAny = false;
+        try {
+            for (const item of items) {
+                const prevSetSize = this.size;
+                super.delete(item);
+                if (this.size !== prevSetSize)
+                    deletedAny = true;
+            }
+        }
+        finally {
+            if (deletedAny) {
+                this.onBatchDeleted.raiseEvent();
+                this.onChanged.raiseEvent();
+            }
+        }
         return prevSize - this.size;
     }
 }
@@ -25019,11 +25172,11 @@ class YieldManager {
 "use strict";
 __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   AbandonedError: () => (/* reexport safe */ _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_21__.AbandonedError),
-/* harmony export */   BeDuration: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_29__.BeDuration),
+/* harmony export */   AbandonedError: () => (/* reexport safe */ _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_22__.AbandonedError),
+/* harmony export */   BeDuration: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_30__.BeDuration),
 /* harmony export */   BeEvent: () => (/* reexport safe */ _BeEvent__WEBPACK_IMPORTED_MODULE_2__.BeEvent),
 /* harmony export */   BeEventList: () => (/* reexport safe */ _BeEvent__WEBPACK_IMPORTED_MODULE_2__.BeEventList),
-/* harmony export */   BeTimePoint: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_29__.BeTimePoint),
+/* harmony export */   BeTimePoint: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_30__.BeTimePoint),
 /* harmony export */   BeUiEvent: () => (/* reexport safe */ _BeEvent__WEBPACK_IMPORTED_MODULE_2__.BeUiEvent),
 /* harmony export */   BeUnorderedEvent: () => (/* reexport safe */ _BeEvent__WEBPACK_IMPORTED_MODULE_2__.BeUnorderedEvent),
 /* harmony export */   BeUnorderedUiEvent: () => (/* reexport safe */ _BeEvent__WEBPACK_IMPORTED_MODULE_2__.BeUnorderedUiEvent),
@@ -25034,15 +25187,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   ByteStream: () => (/* reexport safe */ _ByteStream__WEBPACK_IMPORTED_MODULE_7__.ByteStream),
 /* harmony export */   ChangeSetStatus: () => (/* reexport safe */ _BentleyError__WEBPACK_IMPORTED_MODULE_3__.ChangeSetStatus),
 /* harmony export */   CompressedId64Set: () => (/* reexport safe */ _CompressedId64Set__WEBPACK_IMPORTED_MODULE_10__.CompressedId64Set),
-/* harmony export */   DbChangeStage: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__.DbChangeStage),
-/* harmony export */   DbConflictCause: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__.DbConflictCause),
-/* harmony export */   DbConflictResolution: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__.DbConflictResolution),
+/* harmony export */   DbChangeStage: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__.DbChangeStage),
+/* harmony export */   DbConflictCause: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__.DbConflictCause),
+/* harmony export */   DbConflictResolution: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__.DbConflictResolution),
 /* harmony export */   DbOpcode: () => (/* reexport safe */ _BeSQLite__WEBPACK_IMPORTED_MODULE_6__.DbOpcode),
 /* harmony export */   DbResult: () => (/* reexport safe */ _BeSQLite__WEBPACK_IMPORTED_MODULE_6__.DbResult),
-/* harmony export */   DbValueType: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__.DbValueType),
+/* harmony export */   DbValueType: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__.DbValueType),
 /* harmony export */   Dictionary: () => (/* reexport safe */ _Dictionary__WEBPACK_IMPORTED_MODULE_11__.Dictionary),
 /* harmony export */   DisposableList: () => (/* reexport safe */ _Disposable__WEBPACK_IMPORTED_MODULE_12__.DisposableList),
-/* harmony export */   DuplicatePolicy: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_27__.DuplicatePolicy),
+/* harmony export */   DuplicatePolicy: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_28__.DuplicatePolicy),
 /* harmony export */   Entry: () => (/* reexport safe */ _LRUMap__WEBPACK_IMPORTED_MODULE_19__.Entry),
 /* harmony export */   ErrorCategory: () => (/* reexport safe */ _StatusCategory__WEBPACK_IMPORTED_MODULE_5__.ErrorCategory),
 /* harmony export */   GeoServiceStatus: () => (/* reexport safe */ _BentleyError__WEBPACK_IMPORTED_MODULE_3__.GeoServiceStatus),
@@ -25061,39 +25214,40 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   LogLevel: () => (/* reexport safe */ _Logger__WEBPACK_IMPORTED_MODULE_18__.LogLevel),
 /* harmony export */   Logger: () => (/* reexport safe */ _Logger__WEBPACK_IMPORTED_MODULE_18__.Logger),
 /* harmony export */   MutableCompressedId64Set: () => (/* reexport safe */ _CompressedId64Set__WEBPACK_IMPORTED_MODULE_10__.MutableCompressedId64Set),
-/* harmony export */   ObservableSet: () => (/* reexport safe */ _ObservableSet__WEBPACK_IMPORTED_MODULE_20__.ObservableSet),
-/* harmony export */   OneAtATimeAction: () => (/* reexport safe */ _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_21__.OneAtATimeAction),
+/* harmony export */   ObservableMap: () => (/* reexport safe */ _ObservableMap__WEBPACK_IMPORTED_MODULE_20__.ObservableMap),
+/* harmony export */   ObservableSet: () => (/* reexport safe */ _ObservableSet__WEBPACK_IMPORTED_MODULE_21__.ObservableSet),
+/* harmony export */   OneAtATimeAction: () => (/* reexport safe */ _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_22__.OneAtATimeAction),
 /* harmony export */   OpenMode: () => (/* reexport safe */ _BeSQLite__WEBPACK_IMPORTED_MODULE_6__.OpenMode),
 /* harmony export */   OrderedId64Array: () => (/* reexport safe */ _CompressedId64Set__WEBPACK_IMPORTED_MODULE_10__.OrderedId64Array),
-/* harmony export */   OrderedId64Iterable: () => (/* reexport safe */ _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_22__.OrderedId64Iterable),
-/* harmony export */   OrderedSet: () => (/* reexport safe */ _OrderedSet__WEBPACK_IMPORTED_MODULE_23__.OrderedSet),
+/* harmony export */   OrderedId64Iterable: () => (/* reexport safe */ _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_23__.OrderedId64Iterable),
+/* harmony export */   OrderedSet: () => (/* reexport safe */ _OrderedSet__WEBPACK_IMPORTED_MODULE_24__.OrderedSet),
 /* harmony export */   PerfLogger: () => (/* reexport safe */ _Logger__WEBPACK_IMPORTED_MODULE_18__.PerfLogger),
-/* harmony export */   PriorityQueue: () => (/* reexport safe */ _PriorityQueue__WEBPACK_IMPORTED_MODULE_25__.PriorityQueue),
-/* harmony export */   ProcessDetector: () => (/* reexport safe */ _ProcessDetector__WEBPACK_IMPORTED_MODULE_26__.ProcessDetector),
-/* harmony export */   ReadonlyOrderedSet: () => (/* reexport safe */ _OrderedSet__WEBPACK_IMPORTED_MODULE_23__.ReadonlyOrderedSet),
-/* harmony export */   ReadonlySortedArray: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_27__.ReadonlySortedArray),
+/* harmony export */   PriorityQueue: () => (/* reexport safe */ _PriorityQueue__WEBPACK_IMPORTED_MODULE_26__.PriorityQueue),
+/* harmony export */   ProcessDetector: () => (/* reexport safe */ _ProcessDetector__WEBPACK_IMPORTED_MODULE_27__.ProcessDetector),
+/* harmony export */   ReadonlyOrderedSet: () => (/* reexport safe */ _OrderedSet__WEBPACK_IMPORTED_MODULE_24__.ReadonlyOrderedSet),
+/* harmony export */   ReadonlySortedArray: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_28__.ReadonlySortedArray),
 /* harmony export */   RealityDataStatus: () => (/* reexport safe */ _BentleyError__WEBPACK_IMPORTED_MODULE_3__.RealityDataStatus),
-/* harmony export */   RepositoryStatus: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__.RepositoryStatus),
+/* harmony export */   RepositoryStatus: () => (/* reexport safe */ _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__.RepositoryStatus),
 /* harmony export */   RpcInterfaceStatus: () => (/* reexport safe */ _BentleyError__WEBPACK_IMPORTED_MODULE_3__.RpcInterfaceStatus),
-/* harmony export */   SortedArray: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_27__.SortedArray),
-/* harmony export */   SpanKind: () => (/* reexport safe */ _Tracing__WEBPACK_IMPORTED_MODULE_30__.SpanKind),
+/* harmony export */   SortedArray: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_28__.SortedArray),
+/* harmony export */   SpanKind: () => (/* reexport safe */ _Tracing__WEBPACK_IMPORTED_MODULE_31__.SpanKind),
 /* harmony export */   StatusCategory: () => (/* reexport safe */ _StatusCategory__WEBPACK_IMPORTED_MODULE_5__.StatusCategory),
-/* harmony export */   StopWatch: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_29__.StopWatch),
+/* harmony export */   StopWatch: () => (/* reexport safe */ _Time__WEBPACK_IMPORTED_MODULE_30__.StopWatch),
 /* harmony export */   SuccessCategory: () => (/* reexport safe */ _StatusCategory__WEBPACK_IMPORTED_MODULE_5__.SuccessCategory),
-/* harmony export */   Tracing: () => (/* reexport safe */ _Tracing__WEBPACK_IMPORTED_MODULE_30__.Tracing),
+/* harmony export */   Tracing: () => (/* reexport safe */ _Tracing__WEBPACK_IMPORTED_MODULE_31__.Tracing),
 /* harmony export */   TransientIdSequence: () => (/* reexport safe */ _Id__WEBPACK_IMPORTED_MODULE_14__.TransientIdSequence),
-/* harmony export */   TupleKeyedMap: () => (/* reexport safe */ _TupleKeyedMap__WEBPACK_IMPORTED_MODULE_31__.TupleKeyedMap),
-/* harmony export */   TypedArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__.TypedArrayBuilder),
-/* harmony export */   Uint16ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__.Uint16ArrayBuilder),
-/* harmony export */   Uint32ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__.Uint32ArrayBuilder),
-/* harmony export */   Uint8ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__.Uint8ArrayBuilder),
-/* harmony export */   UintArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__.UintArrayBuilder),
-/* harmony export */   UnexpectedErrors: () => (/* reexport safe */ _UnexpectedErrors__WEBPACK_IMPORTED_MODULE_33__.UnexpectedErrors),
-/* harmony export */   YieldManager: () => (/* reexport safe */ _YieldManager__WEBPACK_IMPORTED_MODULE_36__.YieldManager),
+/* harmony export */   TupleKeyedMap: () => (/* reexport safe */ _TupleKeyedMap__WEBPACK_IMPORTED_MODULE_32__.TupleKeyedMap),
+/* harmony export */   TypedArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__.TypedArrayBuilder),
+/* harmony export */   Uint16ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__.Uint16ArrayBuilder),
+/* harmony export */   Uint32ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__.Uint32ArrayBuilder),
+/* harmony export */   Uint8ArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__.Uint8ArrayBuilder),
+/* harmony export */   UintArrayBuilder: () => (/* reexport safe */ _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__.UintArrayBuilder),
+/* harmony export */   UnexpectedErrors: () => (/* reexport safe */ _UnexpectedErrors__WEBPACK_IMPORTED_MODULE_34__.UnexpectedErrors),
+/* harmony export */   YieldManager: () => (/* reexport safe */ _YieldManager__WEBPACK_IMPORTED_MODULE_37__.YieldManager),
 /* harmony export */   areEqualPossiblyUndefined: () => (/* reexport safe */ _Compare__WEBPACK_IMPORTED_MODULE_9__.areEqualPossiblyUndefined),
-/* harmony export */   asInstanceOf: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_35__.asInstanceOf),
+/* harmony export */   asInstanceOf: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_36__.asInstanceOf),
 /* harmony export */   assert: () => (/* reexport safe */ _Assert__WEBPACK_IMPORTED_MODULE_1__.assert),
-/* harmony export */   base64StringToUint8Array: () => (/* reexport safe */ _StringUtils__WEBPACK_IMPORTED_MODULE_28__.base64StringToUint8Array),
+/* harmony export */   base64StringToUint8Array: () => (/* reexport safe */ _StringUtils__WEBPACK_IMPORTED_MODULE_29__.base64StringToUint8Array),
 /* harmony export */   compareArrays: () => (/* reexport safe */ _Compare__WEBPACK_IMPORTED_MODULE_9__.compareArrays),
 /* harmony export */   compareBooleans: () => (/* reexport safe */ _Compare__WEBPACK_IMPORTED_MODULE_9__.compareBooleans),
 /* harmony export */   compareBooleansOrUndefined: () => (/* reexport safe */ _Compare__WEBPACK_IMPORTED_MODULE_9__.compareBooleansOrUndefined),
@@ -25111,16 +25265,16 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   expectNotNull: () => (/* reexport safe */ _Expect__WEBPACK_IMPORTED_MODULE_13__.expectNotNull),
 /* harmony export */   isDisposable: () => (/* reexport safe */ _Disposable__WEBPACK_IMPORTED_MODULE_12__.isDisposable),
 /* harmony export */   isIDisposable: () => (/* reexport safe */ _Disposable__WEBPACK_IMPORTED_MODULE_12__.isIDisposable),
-/* harmony export */   isInstanceOf: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_35__.isInstanceOf),
+/* harmony export */   isInstanceOf: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_36__.isInstanceOf),
 /* harmony export */   isProperSubclassOf: () => (/* reexport safe */ _ClassUtils__WEBPACK_IMPORTED_MODULE_8__.isProperSubclassOf),
 /* harmony export */   isSubclassOf: () => (/* reexport safe */ _ClassUtils__WEBPACK_IMPORTED_MODULE_8__.isSubclassOf),
-/* harmony export */   lowerBound: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_27__.lowerBound),
-/* harmony export */   omit: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_35__.omit),
-/* harmony export */   partitionArray: () => (/* reexport safe */ _partitionArray__WEBPACK_IMPORTED_MODULE_24__.partitionArray),
-/* harmony export */   shallowClone: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_27__.shallowClone),
+/* harmony export */   lowerBound: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_28__.lowerBound),
+/* harmony export */   omit: () => (/* reexport safe */ _UtilityTypes__WEBPACK_IMPORTED_MODULE_36__.omit),
+/* harmony export */   partitionArray: () => (/* reexport safe */ _partitionArray__WEBPACK_IMPORTED_MODULE_25__.partitionArray),
+/* harmony export */   shallowClone: () => (/* reexport safe */ _SortedArray__WEBPACK_IMPORTED_MODULE_28__.shallowClone),
 /* harmony export */   using: () => (/* reexport safe */ _Disposable__WEBPACK_IMPORTED_MODULE_12__.using),
-/* harmony export */   utf8ToString: () => (/* reexport safe */ _StringUtils__WEBPACK_IMPORTED_MODULE_28__.utf8ToString),
-/* harmony export */   wrapTimerCallback: () => (/* reexport safe */ _UtilityFunctions__WEBPACK_IMPORTED_MODULE_34__.wrapTimerCallback)
+/* harmony export */   utf8ToString: () => (/* reexport safe */ _StringUtils__WEBPACK_IMPORTED_MODULE_29__.utf8ToString),
+/* harmony export */   wrapTimerCallback: () => (/* reexport safe */ _UtilityFunctions__WEBPACK_IMPORTED_MODULE_35__.wrapTimerCallback)
 /* harmony export */ });
 /* harmony import */ var _AccessToken__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./AccessToken */ "../../core/bentley/lib/esm/AccessToken.js");
 /* harmony import */ var _Assert__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Assert */ "../../core/bentley/lib/esm/Assert.js");
@@ -25142,24 +25296,25 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _JsonUtils__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./JsonUtils */ "../../core/bentley/lib/esm/JsonUtils.js");
 /* harmony import */ var _Logger__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./Logger */ "../../core/bentley/lib/esm/Logger.js");
 /* harmony import */ var _LRUMap__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./LRUMap */ "../../core/bentley/lib/esm/LRUMap.js");
-/* harmony import */ var _ObservableSet__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./ObservableSet */ "../../core/bentley/lib/esm/ObservableSet.js");
-/* harmony import */ var _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./OneAtATimeAction */ "../../core/bentley/lib/esm/OneAtATimeAction.js");
-/* harmony import */ var _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ./OrderedId64Iterable */ "../../core/bentley/lib/esm/OrderedId64Iterable.js");
-/* harmony import */ var _OrderedSet__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ./OrderedSet */ "../../core/bentley/lib/esm/OrderedSet.js");
-/* harmony import */ var _partitionArray__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ./partitionArray */ "../../core/bentley/lib/esm/partitionArray.js");
-/* harmony import */ var _PriorityQueue__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ./PriorityQueue */ "../../core/bentley/lib/esm/PriorityQueue.js");
-/* harmony import */ var _ProcessDetector__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ./ProcessDetector */ "../../core/bentley/lib/esm/ProcessDetector.js");
-/* harmony import */ var _SortedArray__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ./SortedArray */ "../../core/bentley/lib/esm/SortedArray.js");
-/* harmony import */ var _StringUtils__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ./StringUtils */ "../../core/bentley/lib/esm/StringUtils.js");
-/* harmony import */ var _Time__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ./Time */ "../../core/bentley/lib/esm/Time.js");
-/* harmony import */ var _Tracing__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./Tracing */ "../../core/bentley/lib/esm/Tracing.js");
-/* harmony import */ var _TupleKeyedMap__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ./TupleKeyedMap */ "../../core/bentley/lib/esm/TupleKeyedMap.js");
-/* harmony import */ var _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./TypedArrayBuilder */ "../../core/bentley/lib/esm/TypedArrayBuilder.js");
-/* harmony import */ var _UnexpectedErrors__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ./UnexpectedErrors */ "../../core/bentley/lib/esm/UnexpectedErrors.js");
-/* harmony import */ var _UtilityFunctions__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./UtilityFunctions */ "../../core/bentley/lib/esm/UtilityFunctions.js");
-/* harmony import */ var _UtilityTypes__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./UtilityTypes */ "../../core/bentley/lib/esm/UtilityTypes.js");
-/* harmony import */ var _YieldManager__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./YieldManager */ "../../core/bentley/lib/esm/YieldManager.js");
-/* harmony import */ var _internal_cross_package__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./internal/cross-package */ "../../core/bentley/lib/esm/internal/cross-package.js");
+/* harmony import */ var _ObservableMap__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./ObservableMap */ "../../core/bentley/lib/esm/ObservableMap.js");
+/* harmony import */ var _ObservableSet__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./ObservableSet */ "../../core/bentley/lib/esm/ObservableSet.js");
+/* harmony import */ var _OneAtATimeAction__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ./OneAtATimeAction */ "../../core/bentley/lib/esm/OneAtATimeAction.js");
+/* harmony import */ var _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ./OrderedId64Iterable */ "../../core/bentley/lib/esm/OrderedId64Iterable.js");
+/* harmony import */ var _OrderedSet__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ./OrderedSet */ "../../core/bentley/lib/esm/OrderedSet.js");
+/* harmony import */ var _partitionArray__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ./partitionArray */ "../../core/bentley/lib/esm/partitionArray.js");
+/* harmony import */ var _PriorityQueue__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ./PriorityQueue */ "../../core/bentley/lib/esm/PriorityQueue.js");
+/* harmony import */ var _ProcessDetector__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ./ProcessDetector */ "../../core/bentley/lib/esm/ProcessDetector.js");
+/* harmony import */ var _SortedArray__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ./SortedArray */ "../../core/bentley/lib/esm/SortedArray.js");
+/* harmony import */ var _StringUtils__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ./StringUtils */ "../../core/bentley/lib/esm/StringUtils.js");
+/* harmony import */ var _Time__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./Time */ "../../core/bentley/lib/esm/Time.js");
+/* harmony import */ var _Tracing__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ./Tracing */ "../../core/bentley/lib/esm/Tracing.js");
+/* harmony import */ var _TupleKeyedMap__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./TupleKeyedMap */ "../../core/bentley/lib/esm/TupleKeyedMap.js");
+/* harmony import */ var _TypedArrayBuilder__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ./TypedArrayBuilder */ "../../core/bentley/lib/esm/TypedArrayBuilder.js");
+/* harmony import */ var _UnexpectedErrors__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./UnexpectedErrors */ "../../core/bentley/lib/esm/UnexpectedErrors.js");
+/* harmony import */ var _UtilityFunctions__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./UtilityFunctions */ "../../core/bentley/lib/esm/UtilityFunctions.js");
+/* harmony import */ var _UtilityTypes__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./UtilityTypes */ "../../core/bentley/lib/esm/UtilityTypes.js");
+/* harmony import */ var _YieldManager__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./YieldManager */ "../../core/bentley/lib/esm/YieldManager.js");
+/* harmony import */ var _internal_cross_package__WEBPACK_IMPORTED_MODULE_38__ = __webpack_require__(/*! ./internal/cross-package */ "../../core/bentley/lib/esm/internal/cross-package.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -25199,6 +25354,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 // Temporarily (until 5.0) export top-level internal APIs to avoid breaking callers.
@@ -35766,6 +35922,7 @@ function isBinaryImageSource(source) {
 __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   getPullChangesIpcChannel: () => (/* binding */ getPullChangesIpcChannel),
+/* harmony export */   getPushChangesIpcChannel: () => (/* binding */ getPushChangesIpcChannel),
 /* harmony export */   ipcAppChannels: () => (/* binding */ ipcAppChannels)
 /* harmony export */ });
 /*---------------------------------------------------------------------------------------------
@@ -35776,9 +35933,16 @@ __webpack_require__.r(__webpack_exports__);
  * @module NativeApp
  */
 /** Get IPC channel name used for reporting progress of pulling changes into iModel.
+ * @param key the key of the briefcase being pulled into.
+ * @internal
+ */
+const getPullChangesIpcChannel = (key) => `${ipcAppChannels.functions}/pullChanges/${key}`;
+/** Get IPC channel name used for reporting the progress of the changeset download that [[IpcAppFunctions.pushChanges]] performs before
+ * uploading. Kept distinct from [[getPullChangesIpcChannel]] so that a listener attached for a pull never observes a push's download.
+ * @param key the key of the briefcase being pushed from.
  * @internal
  */
-const getPullChangesIpcChannel = (iModelId) => `${ipcAppChannels.functions}/pullChanges/${iModelId}`;
+const getPushChangesIpcChannel = (key) => `${ipcAppChannels.functions}/pushChanges/pullProgress/${key}`;
 /** @internal */
 const ipcAppChannels = {
     functions: "itwinjs-core/ipc-app",
@@ -45614,6 +45778,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   getMarkerText: () => (/* reexport safe */ _annotation_TextBlock__WEBPACK_IMPORTED_MODULE_3__.getMarkerText),
 /* harmony export */   getMaximumMajorTileFormatVersion: () => (/* reexport safe */ _tile_TileMetadata__WEBPACK_IMPORTED_MODULE_163__.getMaximumMajorTileFormatVersion),
 /* harmony export */   getPullChangesIpcChannel: () => (/* reexport safe */ _IpcAppProps__WEBPACK_IMPORTED_MODULE_80__.getPullChangesIpcChannel),
+/* harmony export */   getPushChangesIpcChannel: () => (/* reexport safe */ _IpcAppProps__WEBPACK_IMPORTED_MODULE_80__.getPushChangesIpcChannel),
 /* harmony export */   getTileObjectReference: () => (/* reexport safe */ _TileProps__WEBPACK_IMPORTED_MODULE_122__.getTileObjectReference),
 /* harmony export */   iModelTileTreeIdToString: () => (/* reexport safe */ _tile_TileMetadata__WEBPACK_IMPORTED_MODULE_163__.iModelTileTreeIdToString),
 /* harmony export */   iTwinChannel: () => (/* reexport safe */ _ipc_IpcSocket__WEBPACK_IMPORTED_MODULE_74__.iTwinChannel),
@@ -62238,6 +62403,17 @@ class SchemaCache {
             return entry.schemaInfo;
         return undefined;
     }
+    /**
+      * Gets the schema info which matches the provided SchemaKey.  The schema info may be returned before the schema is fully loaded.
+      * Does not await partially loaded schemas.
+      * @param schemaKey The SchemaKey describing the schema to get from the cache.
+      * @param matchType The match type to use when locating the schema
+      */
+    getSchemaInfoSync(schemaKey, matchType = _ECObjects__WEBPACK_IMPORTED_MODULE_0__.SchemaMatchType.Latest) {
+        if (this.count === 0)
+            return undefined;
+        return this.findEntry(schemaKey, matchType)?.schemaInfo;
+    }
     /**
      * Gets the schema which matches the provided SchemaKey.  If the schema is partially loaded an exception will be thrown.
      * @param schemaKey The SchemaKey describing the schema to get from the cache.
@@ -62435,6 +62611,16 @@ class SchemaContext {
     getCachedSchemaSync(schemaKey, matchType = _ECObjects__WEBPACK_IMPORTED_MODULE_0__.SchemaMatchType.Latest) {
         return this._knownSchemas.getSchemaSync(schemaKey, matchType);
     }
+    /**
+     * Attempts to get a SchemaInfo from the context's cache.
+     * Returns the info even if the schema is only partially loaded.
+     * @param schemaKey The SchemaKey to identify the Schema.
+     * @param matchType The SchemaMatch type to use. Default is SchemaMatchType.Latest.
+     * @internal
+     */
+    getCachedSchemaInfoSync(schemaKey, matchType = _ECObjects__WEBPACK_IMPORTED_MODULE_0__.SchemaMatchType.Latest) {
+        return this._knownSchemas.getSchemaInfoSync(schemaKey, matchType);
+    }
     async getSchemaItem(schemaNameOrKey, itemNameOrCtor, itemConstructor) {
         let schemaKey;
         if (typeof schemaNameOrKey === "string") {
@@ -62710,11 +62896,25 @@ class SchemaReadHelper {
         }
         this._schemaInfo = schemaInfo;
         // Need to add this schema to the context to be able to locate schemaItems within the context.
-        if (addSchemaToCache && !this._context.schemaExists(schema.schemaKey)) {
-            await this._context.addSchemaPromise(schemaInfo, schema, this.loadSchema(schemaInfo, schema));
+        if (addSchemaToCache) {
+            this.checkForReadVersionConflict(schema.schemaKey);
+            if (!this._context.schemaExists(schema.schemaKey))
+                await this._context.addSchemaPromise(schemaInfo, schema, this.loadSchema(schemaInfo, schema));
         }
         return schemaInfo;
     }
+    /**
+     * Two read-incompatible versions of the same schema can never substitute for one another.
+     * Detect it here and fail with a clear error.
+     * @param schemaKey The exact key of the schema about to be loaded into the context.
+     */
+    checkForReadVersionConflict(schemaKey) {
+        const existingInfo = this._context.getCachedSchemaInfoSync(new _SchemaKey__WEBPACK_IMPORTED_MODULE_5__.SchemaKey(schemaKey.name), _ECObjects__WEBPACK_IMPORTED_MODULE_1__.SchemaMatchType.Latest);
+        if (existingInfo && existingInfo.schemaKey.readVersion !== schemaKey.readVersion) {
+            throw new _Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaError(_Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaStatus.DuplicateSchema, `The schema '${schemaKey.toString(true)}' cannot be loaded: the read-incompatible version '${existingInfo.schemaKey.toString(true)}' is already loaded in this context. ` +
+                `A schema graph cannot require two read-incompatible versions of the same schema.`);
+        }
+    }
     /**
      * Populates the given Schema from a serialized representation.
      * @param schema The Schema to populate
@@ -62736,7 +62936,7 @@ class SchemaReadHelper {
                 throw new _Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaError(_Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaStatus.UnableToLoadSchema, `Could not load schema ${schema.schemaKey.toString()}`);
             return loadedSchema;
         }
-        const cachedSchema = await this._context.getCachedSchema(schemaInfo.schemaKey, _ECObjects__WEBPACK_IMPORTED_MODULE_1__.SchemaMatchType.Latest);
+        const cachedSchema = await this._context.getCachedSchema(schemaInfo.schemaKey, _ECObjects__WEBPACK_IMPORTED_MODULE_1__.SchemaMatchType.LatestReadCompatible);
         if (undefined === cachedSchema)
             throw new _Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaError(_Exception__WEBPACK_IMPORTED_MODULE_2__.ECSchemaStatus.UnableToLoadSchema, `Could not load schema ${schema.schemaKey.toString()}`);
         return cachedSchema;
@@ -62788,6 +62988,7 @@ class SchemaReadHelper {
         schema.fromJSONSync(this._parser.parseSchema());
         this._schema = schema;
         // Need to add this schema to the context to be able to locate schemaItems within the context.
+        this.checkForReadVersionConflict(schema.schemaKey);
         if (!this._context.schemaExists(schema.schemaKey))
             this._context.addSchemaSync(schema);
         // Load schema references first
@@ -85348,29 +85549,38 @@ class BriefcaseConnection extends _IModelConnection__WEBPACK_IMPORTED_MODULE_5__
     async abandonChanges() {
         await _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.abandonChanges(this.key); // eslint-disable-line @typescript-eslint/no-deprecated
     }
+    /** Subscribes to changeset download progress events on `channel` and wires `abortSignal` to `cancel`.
+     * @returns a function that removes every listener that was added.
+     */
+    listenForChangesetDownloadProgress(args) {
+        const { channel, cancel, downloadProgressCallback, abortSignal } = args;
+        const removeListeners = [];
+        if (downloadProgressCallback) {
+            const handleProgress = (_evt, data) => downloadProgressCallback(data);
+            removeListeners.push(_IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.addListener(channel, handleProgress));
+        }
+        if (abortSignal) {
+            const abort = () => void cancel();
+            abortSignal.addEventListener("abort", abort);
+            removeListeners.push(() => abortSignal.removeEventListener("abort", abort));
+        }
+        return () => removeListeners.forEach((remove) => remove());
+    }
     /** Pull (and potentially merge if there are local changes) up to a specified changeset from iModelHub into this briefcase
      * @param toIndex The changeset index to pull changes to. If `undefined`, pull all changes.
      * @param options Options for pulling changes.
      * @see [[BriefcaseTxns.onChangesPulled]] for the event dispatched after changes are pulled.
      */
     async pullChanges(toIndex, options) {
-        const removeListeners = [];
-        const shouldReportProgress = !!options?.downloadProgressCallback;
-        if (shouldReportProgress) {
-            const handleProgress = (_evt, data) => {
-                options?.downloadProgressCallback?.(data);
-            };
-            const removeProgressListener = _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.addListener((0,_itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.getPullChangesIpcChannel)(this.iModelId), handleProgress);
-            removeListeners.push(removeProgressListener);
-        }
-        if (options?.abortSignal) {
-            const abort = () => void _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.cancelPullChangesRequest(this.key);
-            options?.abortSignal.addEventListener("abort", abort);
-            removeListeners.push(() => options?.abortSignal?.removeEventListener("abort", abort));
-        }
         this.requireTimeline();
+        const removeListeners = this.listenForChangesetDownloadProgress({
+            channel: (0,_itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.getPullChangesIpcChannel)(this.key),
+            cancel: async () => _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.cancelPullChangesRequest(this.key),
+            downloadProgressCallback: options?.downloadProgressCallback,
+            abortSignal: options?.abortSignal,
+        });
         const ipcAppOptions = {
-            reportProgress: shouldReportProgress,
+            reportProgress: !!options?.downloadProgressCallback,
             progressInterval: options?.progressInterval,
             enableCancellation: !!options?.abortSignal,
         };
@@ -85378,18 +85588,29 @@ class BriefcaseConnection extends _IModelConnection__WEBPACK_IMPORTED_MODULE_5__
             this.changeset = await _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.pullChanges(this.key, toIndex, ipcAppOptions);
         }
         finally {
-            removeListeners.forEach((remove) => remove());
+            removeListeners();
         }
         await this.invalidateSchemaViewIfChanged();
     }
-    /** Create a changeset from local Txns and push to iModelHub. On success, clear Txn table.
-     * @param description The description for the changeset
-     * @returns the changesetId of the pushed changes
-     * @see [[BriefcaseTxns.onChangesPushed]] for the event dispatched after changes are pushed.
-     */
-    async pushChanges(description) {
+    async pushChanges(description, options) {
         this.requireTimeline();
-        return this.changeset = await _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.pushChanges(this.key, description);
+        const removeListeners = this.listenForChangesetDownloadProgress({
+            channel: (0,_itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.getPushChangesIpcChannel)(this.key),
+            cancel: async () => _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.cancelPushChangesRequest(this.key),
+            downloadProgressCallback: options?.downloadProgressCallback,
+            abortSignal: options?.abortSignal,
+        });
+        const ipcAppOptions = {
+            reportDownloadProgress: !!options?.downloadProgressCallback,
+            downloadProgressInterval: options?.downloadProgressInterval,
+            enableCancellation: !!options?.abortSignal,
+        };
+        try {
+            return this.changeset = await _IpcApp__WEBPACK_IMPORTED_MODULE_6__.IpcApp.appFunctionIpc.pushChanges(this.key, description, ipcAppOptions);
+        }
+        finally {
+            removeListeners();
+        }
     }
     /** The current graphical editing scope, if one is in progress.
      * @see [[enterEditingScope]] to begin graphical editing.
@@ -99038,20 +99259,11 @@ class TentativePoint {
                     const vp = (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_6__.expectDefined)(ev.viewport);
                     if (vp.isSnapAdjustmentRequired) {
                         _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.toolAdmin.adjustPointToACS(point, vp, false);
-                        const hit = new _HitDetail__WEBPACK_IMPORTED_MODULE_2__.HitDetail({
-                            testPoint: point,
-                            viewport: vp,
-                            hitSource: _HitDetail__WEBPACK_IMPORTED_MODULE_2__.HitSource.TentativeSnap,
-                            hitPoint: point,
-                            sourceId: "",
-                            priority: _HitDetail__WEBPACK_IMPORTED_MODULE_2__.HitPriority.Unknown,
-                            distXY: 0,
-                            distFraction: 0,
-                        });
-                        const snap = new _HitDetail__WEBPACK_IMPORTED_MODULE_2__.SnapDetail(hit);
-                        this.setCurrSnap(snap);
-                        _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.toolAdmin.adjustSnapPoint();
-                        this.setPoint(this.getPoint());
+                        // NOTE: Apply similar adjustments as ToolAdmin.adjustSnapPoint for snap that isn't hot with AccuDraw is active...
+                        _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.toolAdmin.adjustPointToGrid(point, vp);
+                        if (!_IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.accuDraw.adjustPoint(point, vp, false))
+                            _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.toolAdmin.adjustPointToACS(point, vp, true);
+                        this.setPoint(point);
                     }
                     else {
                         _IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.accuDraw.adjustPoint(point, vp, false);
@@ -154121,7 +154333,7 @@ function readPnts(stream, dataOffset, pnts) {
 }
 async function decodeDracoPointCloud(buf) {
     try {
-        const dracoLoader = (await __webpack_require__.e(/*! import() */ "vendors-common_temp_node_modules_pnpm_loaders_gl_draco_4_3_4__loaders_gl_core_4_3_4_node_modu-4c1fc9").then(() => (__webpack_require__(/*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@4.3.4_@loaders.gl+core@4.3.4/node_modules/@loaders.gl/draco/dist/index.js")))).DracoLoader;
+        const dracoLoader = (await __webpack_require__.e(/*! import() */ "vendors-common_temp_node_modules_pnpm_loaders_gl_draco_4_4_5__loaders_gl_core_4_4_5_node_modu-5e3596").then(() => (__webpack_require__(/*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@4.4.5_@loaders.gl+core@4.4.5/node_modules/@loaders.gl/draco/dist/index.js")))).DracoLoader;
         const mesh = await dracoLoader.parse(buf, {});
         if (mesh.topology !== "point-list")
             return undefined;
@@ -166902,7 +167114,7 @@ class GltfReader {
             if (_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.ProcessDetector.isIEBrowser) {
                 throw new Error("Unsupported browser for Draco decoding");
             }
-            const dracoLoader = (await __webpack_require__.e(/*! import() */ "vendors-common_temp_node_modules_pnpm_loaders_gl_draco_4_3_4__loaders_gl_core_4_3_4_node_modu-4c1fc9").then(() => (__webpack_require__(/*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@4.3.4_@loaders.gl+core@4.3.4/node_modules/@loaders.gl/draco/dist/index.js")))).DracoLoader;
+            const dracoLoader = (await __webpack_require__.e(/*! import() */ "vendors-common_temp_node_modules_pnpm_loaders_gl_draco_4_4_5__loaders_gl_core_4_4_5_node_modu-5e3596").then(() => (__webpack_require__(/*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@4.4.5_@loaders.gl+core@4.4.5/node_modules/@loaders.gl/draco/dist/index.js")))).DracoLoader;
             await Promise.all(dracoMeshes.map(async (x) => this.decodeDracoMesh(x, dracoLoader)));
         }
         catch (err) {
@@ -166946,8 +167158,10 @@ class GltfReader {
                 "draco_wasm_wrapper.js": `${_IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.publicPath}scripts/draco_wasm_wrapper.js`,
                 "draco_decoder.wasm": `${_IModelApp__WEBPACK_IMPORTED_MODULE_3__.IModelApp.publicPath}scripts/draco_decoder.wasm`,
             },
-            worker: false,
-            useLocalLibraries: true,
+            core: {
+                worker: false,
+                useLocalLibraries: true,
+            },
         });
         if (mesh)
             this._dracoMeshes.set(ext, mesh);
@@ -194998,15 +195212,18 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /**
- * fitPoints and end condition data for [[AkimaCurve3d]]
+ * Data for an [[AkimaCurve3d]]
  * * This is a "typed object" version of the serializer-friendly [[AkimaCurve3dProps]]
- * * Typical use cases rarely require all parameters, so the constructor does not itemize them as parameters.
  * @public
  */
 class AkimaCurve3dOptions {
+    /**
+     * Points that the curve must pass through.
+     * * Traditional DGN-style Akima curves interpret the first two and last two fit points as end tangent conditions,
+     * however as the current implementation uses another interpolation algorithm, there is no such interpretation here.
+     */
     fitPoints;
     /**
-     *
      * @param fitPoints points to CAPTURE
      * @param knots array to CAPTURE
      */
@@ -195017,7 +195234,7 @@ class AkimaCurve3dOptions {
      * First and last 2 points are "beyond the end" for control of end slope.
     fitPoints: Point3d[];
    
-   /** Clone with strongly typed members reduced to simple json. */
+     /** Clone with strongly typed members reduced to simple json. */
     cloneAsAkimaCurve3dProps() {
         const props = {
             fitPoints: _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_2__.Point3dArray.cloneDeepJSONNumberArrays(this.fitPoints),
@@ -195034,24 +195251,25 @@ class AkimaCurve3dOptions {
         const result = new AkimaCurve3dOptions(_geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_2__.Point3dArray.clonePoint3dArray(source.fitPoints));
         return result;
     }
+    /** Whether the two options are equivalent or both undefined. */
     static areAlmostEqual(dataA, dataB) {
         if (dataA === undefined && dataB === undefined)
             return true;
-        if (dataA !== undefined && dataB !== undefined) {
+        if (dataA !== undefined && dataB !== undefined)
             return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.almostEqualArrays(dataA.fitPoints, dataB.fitPoints, (a, b) => a.isAlmostEqual(b));
-        }
         return false;
     }
 }
 /**
- * Interpolating curve.
+ * Interpolating curve using the Akima formulation.
  * * Derive from [[ProxyCurve]]
  * * Use a [[BSplineCurve3d]] as the proxy
- * *
+ * * Currently the Akima formulation is replaced with a Greville interpolation.
  * @public
  */
 class AkimaCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_0__.ProxyCurve {
-    curvePrimitiveType = "interpolationCurve";
+    /** String name for schema properties. */
+    curvePrimitiveType = "akimaCurve";
     _options;
     /** CAPTURE properties and proxy curve. */
     constructor(properties, proxyCurve) {
@@ -195066,9 +195284,9 @@ class AkimaCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_0__.ProxyC
         return result;
     }
     /**
-     * Create an [[AkimaCurve3d]] based on points, knots, and other properties in the [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
+     * Create an [[AkimaCurve3d]] based on an [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
      * * This saves a COPY OF the options or props.
-     * * Use createCapture () if the options or props can be used without copy
+     * * Use createCapture() if the options or props can be used without copy
      */
     static create(options) {
         let optionsCopy;
@@ -195121,11 +195339,9 @@ class AkimaCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_0__.ProxyC
      * Transform this [[AkimaCurve3d]] and its defining data in place
      */
     tryTransformInPlace(transform) {
-        const proxyOk = this._proxyCurve.tryTransformInPlace(transform);
-        if (proxyOk) {
-            transform.multiplyPoint3dArray(this._options.fitPoints);
-        }
-        return proxyOk;
+        this._proxyCurve.tryTransformInPlace(transform);
+        transform.multiplyPoint3dArray(this._options.fitPoints);
+        return true; // we know this succeeds
     }
     /**
      * Find intervals of this CurvePrimitive that are interior to a clipper.
@@ -195147,6 +195363,7 @@ class AkimaCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_0__.ProxyC
     }
     /** Test if `other` is also an [[AkimaCurve3d]] */
     isSameGeometryClass(other) { return other instanceof AkimaCurve3d; }
+    /** Test if this [[AkimaCurve3d]] is almost equal to another GeometryQuery object. */
     isAlmostEqual(other) {
         if (other instanceof AkimaCurve3d) {
             return AkimaCurve3dOptions.areAlmostEqual(this._options, other._options);
@@ -196051,10 +196268,11 @@ class BSplineCurve3d extends BSplineCurve3dBase {
     }
     /**
      * Create a B-spline curve from an Akima curve.
-     * @param options collection of points and end conditions.
+     * * The Akima formulation of the curve is currently replaced by a Greville interpolation.
+     * @param options data for construction
      */
     static createFromAkimaCurve3dOptions(options) {
-        return _BSplineCurveOps__WEBPACK_IMPORTED_MODULE_19__.BSplineCurveOps.createThroughPoints(options.fitPoints, 4); // temporary
+        return _BSplineCurveOps__WEBPACK_IMPORTED_MODULE_19__.BSplineCurveOps.createThroughPoints(options.fitPoints, 4);
     }
     /**
      * Create a B-spline curve with given knots.
@@ -200091,8 +200309,7 @@ class InterpolationCurve3dOptions {
         result._endTangent = source.endTangent ? _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.fromJSON(source.endTangent) : undefined;
         return result;
     }
-    // ugh.
-    // vector equality test with awkward rule that 000 matches undefined.
+    /** Vector equality test, with the additional rule that the zero vector matches undefined. */
     static areAlmostEqualAllow000AsUndefined(a, b) {
         if (a !== undefined && a.maxAbs() === 0)
             a = undefined;
@@ -200102,6 +200319,7 @@ class InterpolationCurve3dOptions {
             return a.isAlmostEqual(b);
         return a === undefined && b === undefined;
     }
+    /** Whether the two options are equivalent or both undefined. */
     static areAlmostEqual(dataA, dataB) {
         if (dataA === undefined && dataB === undefined)
             return true;
@@ -200150,6 +200368,7 @@ class InterpolationCurve3dOptions {
  * @public
  */
 class InterpolationCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_1__.ProxyCurve {
+    /** String name for schema properties. */
     curvePrimitiveType = "interpolationCurve";
     _options;
     /** CAPTURE properties and proxy curve. */
@@ -200222,15 +200441,13 @@ class InterpolationCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_1_
      * Transform this [[InterpolationCurve3d]] and its defining data in place
      */
     tryTransformInPlace(transform) {
-        const proxyOk = this._proxyCurve.tryTransformInPlace(transform);
-        if (proxyOk) {
-            transform.multiplyPoint3dArrayInPlace(this._options.fitPoints);
-            if (this._options.startTangent)
-                transform.multiplyVectorInPlace(this._options.startTangent);
-            if (this._options.endTangent)
-                transform.multiplyVectorInPlace(this._options.endTangent);
-        }
-        return proxyOk;
+        this._proxyCurve.tryTransformInPlace(transform);
+        transform.multiplyPoint3dArrayInPlace(this._options.fitPoints);
+        if (this._options.startTangent)
+            transform.multiplyVectorInPlace(this._options.startTangent);
+        if (this._options.endTangent)
+            transform.multiplyVectorInPlace(this._options.endTangent);
+        return true; // we know this succeeds
     }
     /**
      * Find intervals of this CurvePrimitive that are interior to a clipper.
@@ -200250,6 +200467,7 @@ class InterpolationCurve3d extends _curve_ProxyCurve__WEBPACK_IMPORTED_MODULE_1_
     cloneTransformed(transform) {
         return super.cloneTransformed(transform);
     }
+    /** Test if this [[InterpolationCurve3d]] is almost equal to another GeometryQuery object. */
     isAlmostEqual(other) {
         if (other instanceof InterpolationCurve3d) {
             return InterpolationCurve3dOptions.areAlmostEqual(this._options, other._options);
@@ -203698,8 +203916,6 @@ class ClipUtilities {
         if (!worldToLocal)
             return result;
         const localRegion = region.cloneTransformed(worldToLocal); // parallel to xy-plane so we can ignore z
-        if (!localRegion)
-            return result;
         // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be
         // convex or even a polygon. We get around this limitation by using a Boolean operation, which admits
         // *any* planar regions, albeit in local coordinates. First, we clip a rectangle that covers the input region
@@ -209335,10 +209551,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * @param options how finely to stroke the path to create the distance index
      */
     cloneTransformed(transform, options) {
-        const c = this._path.clone();
-        if (c.tryTransformInPlace(transform))
-            return CurveChainWithDistanceIndex.createCapture(c, options);
-        return undefined;
+        return CurveChainWithDistanceIndex.createCapture(this._path.cloneTransformed(transform), options);
     }
     /**
      * Reference to the contained path.
@@ -209359,8 +209572,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * @param options how finely to stroke the path to create the distance index
      */
     clone(options) {
-        const c = this._path.clone();
-        return CurveChainWithDistanceIndex.createCapture(c, options);
+        return CurveChainWithDistanceIndex.createCapture(this._path.clone(), options);
     }
     /**
      * Return a portion of this curve with its own distance index.
@@ -209538,15 +209750,10 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * @return cloned flattened CurveChain, or reference to the input chain if no nesting
     */
     static flattenNestedChains(chain) {
-        if (-1 === chain.children.findIndex((child) => { return child instanceof CurveChainWithDistanceIndex; }))
+        if (-1 === chain.children.findIndex((c) => c instanceof CurveChainWithDistanceIndex))
             return chain;
         const flatChain = chain.clone();
-        const flatChildren = flatChain.children.flatMap((child) => {
-            if (child instanceof CurveChainWithDistanceIndex)
-                return child.path.children;
-            else
-                return [child];
-        });
+        const flatChildren = flatChain.children.flatMap((c) => c instanceof CurveChainWithDistanceIndex ? c.path.children : c);
         flatChain.children.splice(0, Infinity, ...flatChildren);
         return flatChain;
     }
@@ -209727,18 +209934,13 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         return result;
     }
     /**
-     * Attempt to transform in place.
-     * * Warning: If any child transform fails, `this` object becomes invalid but that should never happen.
-     * @param transform the transform to be applied.
-     * @returns true if all of child transforms succeed and false otherwise.
+     * Transform the chain in place.
+     * * Does NOT recompute the distance index.
+     * * For best results, use a rigid transform. Otherwise, it is better to call [[cloneTransformed]] so that the
+     * distance index is recomputed.
      */
     tryTransformInPlace(transform) {
-        let numFail = 0;
-        for (const c of this._path.children) {
-            if (!c.tryTransformInPlace(transform))
-                numFail++;
-        }
-        return numFail === 0;
+        return this._path.tryTransformInPlace(transform);
     }
     /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */
     reverseInPlace() {
@@ -210041,8 +210243,6 @@ __webpack_require__.r(__webpack_exports__);
 class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_6__.GeometryQuery {
     /** String name for schema properties */
     geometryCategory = "curveCollection";
-    /** Flag for inner loop status. Only used by `Loop`. */
-    isInner = false;
     /** Return the sum of the lengths of all contained curves. */
     sumLengths() {
         return _internalContexts_SumLengthsContext__WEBPACK_IMPORTED_MODULE_13__.SumLengthsContext.sumLengths(this);
@@ -210324,6 +210524,21 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_6__.Geomet
         return undefined;
     }
     ;
+    /**
+     * Ask if the curves of the collection are within tolerance of the input plane.
+     * @returns whether the collection is nonempty and its curves lie within tolerance of the plane.
+     */
+    isInPlane(plane) {
+        if (0 === this.children.length)
+            return false; // punt on empty parent...
+        for (const child of this.children) {
+            if (child instanceof CurveCollection && 0 === child.children.length)
+                continue; // ...but ignore an empty child
+            if (!child.isInPlane(plane))
+                return false;
+        }
+        return true;
+    }
 }
 /**
  * Shared base class for use by both open and closed paths.
@@ -210435,6 +210650,18 @@ class CurveChain extends CurveCollection {
         }
         return undefined;
     }
+    /** Return a deep copy. */
+    clone() {
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
+    }
     /**
      * Add a child curve.
      * @param child curve to add to the chain. The curve is captured by this instance.
@@ -210565,6 +210792,18 @@ class BagOfCurves extends CurveCollection {
     cloneEmptyPeer() {
         return new BagOfCurves();
     }
+    /** Return a deep copy. */
+    clone() {
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
+    }
     /** Add a child  */
     tryAddChild(child) {
         if (child)
@@ -211556,11 +211795,10 @@ class CurveFactory {
             // The alignment condition is equivalent to positive projected curve area computed wrt to the plane normal.
             const toLocal = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_4__.Matrix3d.createRigidHeadsUp(planeNormal).transpose();
             const projection = closedCurve.cloneTransformed(_geometry3d_Transform__WEBPACK_IMPORTED_MODULE_11__.Transform.createOriginAndMatrix(undefined, toLocal));
-            if (projection) { // now we can ignore z-coords
-                const areaXY = _RegionOps__WEBPACK_IMPORTED_MODULE_25__.RegionOps.computeXYArea(projection);
-                if (areaXY && areaXY < 0)
-                    curve.reverseInPlace();
-            }
+            // now we can ignore z-coords
+            const areaXY = _RegionOps__WEBPACK_IMPORTED_MODULE_25__.RegionOps.computeXYArea(projection);
+            if (areaXY && areaXY < 0)
+                curve.reverseInPlace();
         }
     }
     /**
@@ -212719,9 +212957,9 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
 /* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
-/* harmony import */ var _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./internalContexts/AppendPlaneIntersectionStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js");
-/* harmony import */ var _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./internalContexts/ClosestPointStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js");
-/* harmony import */ var _internalContexts_AnnounceTangentStrokeHandler__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./internalContexts/AnnounceTangentStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js");
+/* harmony import */ var _internalContexts_AnnounceTangentStrokeHandler__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./internalContexts/AnnounceTangentStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js");
+/* harmony import */ var _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./internalContexts/AppendPlaneIntersectionStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js");
+/* harmony import */ var _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./internalContexts/ClosestPointStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js");
 /* harmony import */ var _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./internalContexts/CurveLengthContext */ "../../core/geometry/lib/esm/curve/internalContexts/CurveLengthContext.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -213140,7 +213378,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_9__.Geometr
      * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.
      */
     closestPoint(spacePoint, extend = false, result) {
-        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_11__.ClosestPointStrokeHandler(spacePoint, extend, result);
+        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_12__.ClosestPointStrokeHandler(spacePoint, extend, result);
         this.emitStrokableParts(strokeHandler);
         return strokeHandler.claimResult();
     }
@@ -213156,7 +213394,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_9__.Geometr
      * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.
      */
     closestPointXY(spacePoint, extend = false, result) {
-        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_11__.ClosestPointStrokeHandler(spacePoint, extend, result, true);
+        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_12__.ClosestPointStrokeHandler(spacePoint, extend, result, true);
         this.emitStrokableParts(strokeHandler);
         return strokeHandler.claimResult();
     }
@@ -213172,7 +213410,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_9__.Geometr
      * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.
      */
     emitTangents(spacePoint, announceTangent, options) {
-        const strokeHandler = new _internalContexts_AnnounceTangentStrokeHandler__WEBPACK_IMPORTED_MODULE_12__.AnnounceTangentStrokeHandler(spacePoint, announceTangent, options);
+        const strokeHandler = new _internalContexts_AnnounceTangentStrokeHandler__WEBPACK_IMPORTED_MODULE_10__.AnnounceTangentStrokeHandler(spacePoint, announceTangent, options);
         this.emitStrokableParts(strokeHandler, options?.strokeOptions);
     }
     /**
@@ -213267,7 +213505,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_9__.Geometr
      * @returns Return the number of CurveLocationDetail's added to the result array.
      */
     appendPlaneIntersectionPoints(plane, result) {
-        const strokeHandler = new _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_10__.AppendPlaneIntersectionStrokeHandler(plane, result);
+        const strokeHandler = new _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_11__.AppendPlaneIntersectionStrokeHandler(plane, result);
         const n0 = result.length;
         this.emitStrokableParts(strokeHandler);
         return result.length - n0;
@@ -213465,6 +213703,13 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   RecursiveCurveProcessorWithStack: () => (/* binding */ RecursiveCurveProcessorWithStack)
 /* harmony export */ });
 /* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
 
 /** base class for detailed traversal of curve artifacts.
  * * This recurses to children in the quickest way (no records of path)
@@ -213500,7 +213745,10 @@ class RecursiveCurveProcessor {
     announceUnionRegion(data, _indexInParent = -1) {
         let i = 0;
         for (const child of data.children) {
-            child.announceToCurveProcessor(this, i++);
+            if (child.curveCollectionType === "loop")
+                this.announceLoop(child, i++);
+            else
+                this.announceParityRegion(child, i++);
         }
     }
     /** announce a bag of curves.
@@ -213562,9 +213810,15 @@ class RecursiveCurveProcessorWithStack extends RecursiveCurveProcessor {
         this.leave();
     }
     /** announce beginning or end of a parity region */
-    announceUnionRegion(data, indexInParent = -1) {
+    announceUnionRegion(data, _indexInParent = -1) {
         this.enter(data);
-        super.announceUnionRegion(data, indexInParent);
+        let i = 0;
+        for (const child of data.children) {
+            if (child.curveCollectionType === "loop")
+                this.announceLoop(child, i++);
+            else
+                this.announceParityRegion(child, i++);
+        }
         this.leave();
     }
     /**
@@ -213686,8 +213940,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   GeometryQuery: () => (/* binding */ GeometryQuery)
 /* harmony export */ });
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
+
 
 
 /**
@@ -213701,13 +213957,13 @@ class GeometryQuery {
     range(transform, result) {
         if (result)
             result.setNull();
-        const range = result ? result : _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__.Range3d.createNull();
+        const range = result ? result : _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
         this.extendRange(range, transform);
         return range;
     }
     /** Try to move the geometry by dx,dy,dz. */
     tryTranslateInPlace(dx, dy = 0.0, dz = 0.0) {
-        return this.tryTransformInPlace(_geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__.Transform.createTranslationXYZ(dx, dy, dz));
+        return this.tryTransformInPlace(_geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createTranslationXYZ(dx, dy, dz));
     }
     /**
      * Return GeometryQuery children for recursive queries.
@@ -213757,6 +214013,57 @@ class GeometryQuery {
             return true;
         return false;
     }
+    /**
+     * Compute a distance tolerance appropriate for comparing the coordinates of `geom`.
+     * * The formula is `absTol = minTol + relTol * geomSize`, where `geomSize` is the largest absolute coordinate of
+     * the geometry range.
+     * * Scaling tolerances by geometry size helps account for the decreased floating point resolution between large
+     * coordinates. While using such scaled tolerances can enable more tolerance-sensitive constructions to succeed on
+     * far-flung geometries, on extremely small geometries at extremely large coordinate magnitudes, geometric
+     * constructions are generally more accurate when applied to the geometry temporarily translated to the origin.
+     * @param geom geometry to measure
+     * @param options bundle of options
+     * @returns the computed absolute tolerance
+     * @see [[scaleToleranceForGeometry]]
+     */
+    static computeScaledTolerance(geom, options) {
+        const relTol = Math.abs(options?.relativeTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance);
+        const minTol = Math.abs(options?.minimumTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared);
+        const geomRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
+        (Array.isArray(geom) ? geom : [geom]).forEach((g) => g.extendRange(geomRange, options?.transform));
+        const geomSize = geomRange.isNull ? 0 : options?.xyOnly ? geomRange.maxAbsXY() : geomRange.maxAbs();
+        return minTol + relTol * geomSize;
+    }
+    /**
+     * Scale the given distance tolerance as appropriate for comparing the coordinates of `geom`.
+     * * Scaling tolerances by geometry size helps account for the decreased floating point resolution between large
+     * coordinates. While using such scaled tolerances can enable more tolerance-sensitive constructions to succeed on
+     * far-flung geometries, on extremely small geometries at extremely large coordinate magnitudes, geometric
+     * constructions are generally more accurate when applied to the geometry temporarily translated to the origin.
+     * @param geom geometry to measure
+     * @param distanceTolerance positive input distance tolerance to examine
+     * @param options bundle of options (`minimumTolerance` and `relativeTolerance` are ignored)
+     * @return a distance tolerance >= `distanceTolerance`
+     * @see [[computeScaledTolerance]]
+     */
+    static scaleToleranceForGeometry(geom, distanceTolerance, options) {
+        if (distanceTolerance > 0) {
+            const geomRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
+            (Array.isArray(geom) ? geom : [geom]).forEach((g) => g.extendRange(geomRange, options?.transform));
+            if (!geomRange.isNull) {
+                const geomSize = options?.xyOnly ? geomRange.maxAbsXY() : geomRange.maxAbs();
+                if (geomSize > 0) {
+                    // HEURISTIC: truncate the fractional part of a coordinate's base-10 significand to maxDigits digits.
+                    // Adding the tolerance to this number should change the significand; otherwise, it's too small.
+                    const maxDigits = 10; // comfortably far from IEEE double's 15 guaranteed fractional digits
+                    const requiredDigitsForTol = Math.floor(Math.log10(geomSize / distanceTolerance));
+                    if (requiredDigitsForTol > maxDigits)
+                        distanceTolerance *= Math.pow(10, requiredDigitsForTol - maxDigits);
+                }
+            }
+        }
+        return distanceTolerance;
+    }
 }
 
 
@@ -214117,7 +214424,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_11__.CurveP
         this._point0 = this._point1;
         this._point1 = a;
     }
-    /** Transform the two endpoints of this LinSegment. */
+    /** Transform the two endpoints of this line segment. */
     tryTransformInPlace(transform) {
         this._point0 = transform.multiplyPoint3d(this._point0, this._point0);
         this._point1 = transform.multiplyPoint3d(this._point1, this._point1);
@@ -215932,12 +216239,19 @@ __webpack_require__.r(__webpack_exports__);
 class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_1__.CurveChain {
     /** String name for schema properties */
     curveCollectionType = "loop";
-    /** Tag value that can be set to true for user code to mark inner and outer loops. */
+    /**
+     * Flag for inner loop status (default value is `false`).
+     * * Typical usage is to set to `true` on hole `Loop`s in a `ParityRegion` to distinguish them from the outer `Loop`.
+     * * This property is only set by the user, and does not affect region processing.
+     * * This property is propagated through [[clone]] and JSON/FlatBuffer de/serialization.
+     * * For best de/serialization results, avoid setting to `false` on multiple `Loop`s of a `ParityRegion`.
+     */
     isInner = false;
     /** Test if `other` is a `Loop` */
     isSameGeometryClass(other) {
         return other instanceof Loop;
     }
+    /** Construct an empty loop. */
     constructor() {
         super();
     }
@@ -216007,10 +216321,28 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_1__.CurveChain {
         emptyClone.isInner = this.isInner;
         return emptyClone;
     }
+    /** Return a deep copy. */
+    clone() {
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
+    }
     /** Second step of double dispatch:  call `handler.handleLoop(this)` */
     dispatchToGeometryHandler(handler) {
         return handler.handleLoop(this);
     }
+    /** Test for near equality */
+    isAlmostEqual(other) {
+        if (!super.isAlmostEqual(other))
+            return false;
+        return this.isInner === other.isInner;
+    }
 }
 /**
  * Structure carrying a pair of loops with curve geometry.
@@ -216318,14 +216650,15 @@ class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCo
     }
     /** Return a deep copy. */
     clone() {
-        const clone = new ParityRegion();
-        let child;
-        for (child of this.children) {
-            const childClone = child.clone();
-            if (childClone instanceof _Loop__WEBPACK_IMPORTED_MODULE_1__.Loop)
-                clone.children.push(childClone);
-        }
-        return clone;
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
     }
     /** Stroke these curves into a new ParityRegion. */
     cloneStroked(options) {
@@ -216454,6 +216787,18 @@ class Path extends _CurveCollection__WEBPACK_IMPORTED_MODULE_2__.CurveChain {
     cloneEmptyPeer() {
         return new Path();
     }
+    /** Return a deep copy. */
+    clone() {
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
+    }
     /** Second step of double dispatch: call `handler.handlePath(this)` */
     dispatchToGeometryHandler(handler) {
         return handler.handlePath(this);
@@ -216729,9 +217074,8 @@ class ProxyCurve extends _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.Curv
     /** Return a transformed clone. */
     cloneTransformed(transform) {
         const myClone = this.clone();
-        if (myClone.tryTransformInPlace(transform))
-            return myClone;
-        return undefined;
+        myClone.tryTransformInPlace(transform);
+        return myClone;
     }
     /** Implement by proxyCurve. Subclasses may eventually override this default implementation. */
     clonePartialCurve(fractionA, fractionB) {
@@ -217400,8 +217744,8 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** @packageDocumentation
- * @module Curve
+/**
+ * @internal
  */
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     primitiveToPair = new Map();
@@ -217471,7 +217815,7 @@ class PlanarSubdivision {
      * @param allPairs array of curve-curve xy-intersections
      * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, radianTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallAngleRadians) {
         // map from key CurvePrimitive to CurveLocationDetailPair
         const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();
         for (const pair of allPairs)
@@ -217519,7 +217863,7 @@ class PlanarSubdivision {
             this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);
         }
         // every edge got its sortAngle defined by addHalfEdge
-        _topology_Merging__WEBPACK_IMPORTED_MODULE_5__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle ?? 0, mergeTolerance);
+        _topology_Merging__WEBPACK_IMPORTED_MODULE_5__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle ?? 0, mergeTolerance, radianTolerance);
         return graph;
     }
     /**
@@ -218800,8 +219144,6 @@ class RegionOps {
             const worldToLocal = localToWorld.inverse();
             (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(worldToLocal !== undefined, "FrameBuilder's transform is invertible");
             regionXY = region.cloneTransformed(worldToLocal);
-            if (!regionXY)
-                return undefined;
         }
         const momentData = RegionOps.computeXYAreaMoments(regionXY);
         if (!momentData)
@@ -219664,6 +220006,7 @@ class RegionOps {
      * to the edge and a constituent curve in each.
      */
     static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, addBridges = true) {
+        tolerance = _GeometryQuery__WEBPACK_IMPORTED_MODULE_25__.GeometryQuery.scaleToleranceForGeometry(curvesAndRegions, tolerance, { xyOnly: true });
         let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
         primitives = _internalContexts_TransferWithSplitArcs__WEBPACK_IMPORTED_MODULE_28__.TransferWithSplitArcs.clone(_CurveCollection__WEBPACK_IMPORTED_MODULE_19__.BagOfCurves.create(...primitives)).children;
         let hasOpenCurve = false;
@@ -219686,8 +220029,9 @@ class RegionOps {
                 });
             }
         }
+        const radianTolerance = 10000 * _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallAngleRadians; // be generous, and rely on curvature to break ties
         const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_20__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
-        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_38__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
+        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_38__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance, radianTolerance);
         if (addBridges && hasOpenCurve)
             RegionOps.removeExtraneousBridgeEdges(graph);
         const areaTol = this.computeMinimumArea(tolerance);
@@ -221028,6 +221372,18 @@ class UnionRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCol
     cloneEmptyPeer() {
         return new UnionRegion();
     }
+    /** Return a deep copy. */
+    clone() {
+        return super.clone();
+    }
+    /** Create a deep copy of transformed curves. */
+    cloneTransformed(transform) {
+        return super.cloneTransformed(transform);
+    }
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
+    cloneWithExpandedLineStrings() {
+        return super.cloneWithExpandedLineStrings();
+    }
     /**
      * Try to add a child (by capturing it).
      * * Returns false if the `AnyCurve` child is not a region type.
@@ -221640,6 +221996,7 @@ __webpack_require__.r(__webpack_exports__);
  * Algorithmic class for cloning curve collections.
  * * recurse through collection nodes, building image nodes as needed and inserting clones of children.
  * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent
+ * @internal
  */
 class CloneCurvesContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_1__.RecursiveCurveProcessorWithStack {
     _result;
@@ -221678,7 +222035,7 @@ class CloneCurvesContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_1__.Re
         const c = this.doClone(primitive);
         if (c !== undefined && this._stack.length > 0) {
             const parent = this._stack[this._stack.length - 1];
-            if (parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain || parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.BagOfCurves)
+            if (parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain || parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.BagOfCurves) {
                 if (Array.isArray(c)) {
                     for (const c1 of c) {
                         parent.tryAddChild(c1);
@@ -221687,6 +222044,7 @@ class CloneCurvesContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_1__.Re
                 else {
                     parent.tryAddChild(c);
                 }
+            }
         }
     }
 }
@@ -227514,26 +227872,34 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   TransformInPlaceContext: () => (/* binding */ TransformInPlaceContext)
 /* harmony export */ });
-/* harmony import */ var _CurveProcessor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../CurveProcessor */ "../../core/geometry/lib/esm/curve/CurveProcessor.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _CurveProcessor__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../CurveProcessor */ "../../core/geometry/lib/esm/curve/CurveProcessor.js");
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
 
-/** Algorithmic class: Transform curves in place.
+
+/** Algorithmic class: Transform curves in place. Always expected to succeed.
  * @internal
  */
-class TransformInPlaceContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_0__.RecursiveCurveProcessor {
-    numFail;
-    numOK;
+class TransformInPlaceContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_1__.RecursiveCurveProcessor {
     transform;
-    constructor(transform) { super(); this.numFail = 0; this.numOK = 0; this.transform = transform; }
+    constructor(transform) {
+        super();
+        this.transform = transform;
+    }
     static tryTransformInPlace(target, transform) {
         const context = new TransformInPlaceContext(transform);
         target.announceToCurveProcessor(context);
-        return context.numFail === 0;
+        return true;
     }
     announceCurvePrimitive(curvePrimitive, _indexInParent) {
         if (!curvePrimitive.tryTransformInPlace(this.transform))
-            this.numFail++;
-        else
-            this.numOK++;
+            (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(false, "TransformInPlaceContext: unexpected failure of tryTransformInPlace");
     }
 }
 
@@ -230969,9 +231335,12 @@ class DirectSpiral3d extends _TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_13__.T
     clone() {
         return new DirectSpiral3d(this.localToWorld.clone(), this._spiralType, this.designProperties?.clone(), this._nominalL1, this._nominalR1, this._activeFractionInterval?.clone(), this._evaluator.clone());
     }
-    /** Apply `transform` to this spiral's local to world transform. */
-    tryTransformInPlace(transformA) {
-        const rigidData = this.applyRigidPartOfTransform(transformA);
+    /**
+     * Apply `transform` to this spiral's local to world transform.
+     * * Only the rigid part of the transform is applied.
+     */
+    tryTransformInPlace(transform) {
+        const rigidData = this.applyRigidPartOfTransform(transform);
         if (rigidData !== undefined) {
             this._nominalL1 *= rigidData.scale;
             this._nominalR1 *= rigidData.scale;
@@ -231376,9 +231745,12 @@ class IntegratedSpiral3d extends _TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_15
     clone() {
         return new IntegratedSpiral3d(this._spiralType, this._evaluator, this.radius01.clone(), this.bearing01.clone(), this.activeFractionInterval.clone(), this.localToWorld.clone(), this._arcLength01, this._designProperties?.clone());
     }
-    /** Apply `transform` to this spiral's local to world transform. */
-    tryTransformInPlace(transformA) {
-        const rigidData = this.applyRigidPartOfTransform(transformA);
+    /**
+     * Apply `transform` to this spiral's local to world transform.
+     * * Only the rigid part of the transform is applied.
+     */
+    tryTransformInPlace(transform) {
+        const rigidData = this.applyRigidPartOfTransform(transform);
         if (rigidData !== undefined) {
             this._curvature01.x0 /= rigidData.scale;
             this._curvature01.x1 /= rigidData.scale;
@@ -245610,6 +245982,10 @@ class XYZ {
     maxAbs() {
         return Math.max(Math.abs(this.x), Math.abs(this.y), Math.abs(this.z));
     }
+    /** Return the larger absolute value of the x and y components */
+    maxAbsXY() {
+        return Math.max(Math.abs(this.x), Math.abs(this.y));
+    }
     /** Return the sqrt of the sum of squared x,y,z parts */
     magnitude() {
         return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z);
@@ -251415,6 +251791,12 @@ class Range3d extends RangeBase {
             return 0.0;
         return Math.max(this.low.maxAbs(), this.high.maxAbs());
     }
+    /** Return the largest absolute value among the x and y coordinates in the box corners. */
+    maxAbsXY() {
+        if (this.isNull)
+            return 0.0;
+        return Math.max(this.low.maxAbsXY(), this.high.maxAbsXY());
+    }
     /** Returns true if the x direction size is nearly zero */
     get isAlmostZeroX() {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.xLength());
@@ -270578,9 +270960,9 @@ class PolyfaceQuery {
         let normalCounter = 0;
         for (visitor.reset(); visitor.moveToNextFacet();) {
             const numEdges = visitor.pointCount - 1;
-            const normal = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_14__.PolygonOps.centroidAreaNormal(visitor.point);
+            const normal = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_14__.PolygonOps.areaNormalGo(visitor.point);
             if (normal === undefined)
-                return -2;
+                continue; // skip degenerate facets
             facetNormals.push(normal);
             for (let i = 0; i < numEdges; i++) {
                 const edge = edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), normalCounter);
@@ -270613,8 +270995,8 @@ class PolyfaceQuery {
                 else {
                     edgeVector.setFrom(sideA.edgeVector);
                 }
-                const facetNormalA = facetNormals[sideA.facetIndex].direction;
-                const facetNormalB = facetNormals[sideB.facetIndex].direction;
+                const facetNormalA = facetNormals[sideA.facetIndex];
+                const facetNormalB = facetNormals[sideB.facetIndex];
                 const dihedralAngle = facetNormalA.signedAngleTo(facetNormalB, edgeVector);
                 if (dihedralAngle.isAlmostZero)
                     numPlanar++;
@@ -282316,8 +282698,11 @@ function nullToUndefined(data) {
 function createTypedCurveCollection(collectionType) {
     if (collectionType === 1)
         return new _curve_Path__WEBPACK_IMPORTED_MODULE_14__.Path();
-    if (collectionType === 2 || collectionType === 3)
-        return new _curve_Loop__WEBPACK_IMPORTED_MODULE_12__.Loop();
+    if (collectionType === 2 || collectionType === 3) {
+        const loop = new _curve_Loop__WEBPACK_IMPORTED_MODULE_12__.Loop();
+        loop.isInner = collectionType === 3;
+        return loop;
+    }
     if (collectionType === 4)
         return new _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_13__.ParityRegion();
     if (collectionType === 5)
@@ -282551,9 +282936,8 @@ class BGFBWriter {
         let cvType = 0;
         if (cv instanceof _curve_Path__WEBPACK_IMPORTED_MODULE_16__.Path)
             cvType = 1;
-        else if (cv instanceof _curve_Loop__WEBPACK_IMPORTED_MODULE_14__.Loop) {
+        else if (cv instanceof _curve_Loop__WEBPACK_IMPORTED_MODULE_14__.Loop)
             cvType = cv.isInner ? 3 : 2;
-        }
         else if (cv instanceof _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_15__.ParityRegion)
             cvType = 4;
         else if (cv instanceof _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_21__.UnionRegion)
@@ -283759,16 +284143,17 @@ var IModelJson;
             return undefined;
         }
         /** parse contents of a curve collection to a CurveCollection instance */
-        static parseCurveCollectionMembers(result, data) {
-            if (data && Array.isArray(data)) {
-                for (const c of data) {
-                    const g = Reader.parse(c);
-                    if (g instanceof _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_11__.GeometryQuery && ("curveCollection" === g.geometryCategory || "curvePrimitive" === g.geometryCategory))
-                        result.tryAddChild(g);
-                }
-                return result;
+        static parseCurveCollectionMembers(result, data, isInner = false) {
+            if (!data || !Array.isArray(data))
+                return undefined;
+            for (const c of data) {
+                const g = Reader.parse(c);
+                if (g instanceof _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_11__.GeometryQuery && ("curveCollection" === g.geometryCategory || "curvePrimitive" === g.geometryCategory))
+                    result.tryAddChild(g);
             }
-            return undefined;
+            if (isInner && result instanceof _curve_Loop__WEBPACK_IMPORTED_MODULE_14__.Loop)
+                result.isInner = true;
+            return result;
         }
         /** Parse content of `bsurf` to BSplineSurface3d or BSplineSurface3dH */
         static parseBsurf(data) {
@@ -283986,7 +284371,7 @@ var IModelJson;
                     return Reader.parseCurveCollectionMembers(new _curve_Path__WEBPACK_IMPORTED_MODULE_16__.Path(), json.path);
                 }
                 else if (json.hasOwnProperty("loop")) {
-                    return Reader.parseCurveCollectionMembers(new _curve_Loop__WEBPACK_IMPORTED_MODULE_14__.Loop(), json.loop);
+                    return Reader.parseCurveCollectionMembers(new _curve_Loop__WEBPACK_IMPORTED_MODULE_14__.Loop(), json.loop, json.hasOwnProperty("isInner") && true === json.isInner);
                 }
                 else if (json.hasOwnProperty("parityRegion")) {
                     return Reader.parseCurveCollectionMembers(new _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_15__.ParityRegion(), json.parityRegion);
@@ -284312,7 +284697,7 @@ var IModelJson;
         }
         /** Convert strongly typed instance to tagged json */
         handleLoop(data) {
-            return { loop: this.collectChildren(data) };
+            return { loop: this.collectChildren(data), isInner: data.isInner ? true : undefined };
         }
         /** Convert strongly typed instance to tagged json */
         handleParityRegion(data) {
@@ -284328,12 +284713,10 @@ var IModelJson;
         }
         collectChildren(data) {
             const children = [];
-            if (data.children && Array.isArray(data.children)) {
-                for (const child of data.children) {
-                    const cdata = child.dispatchToGeometryHandler(this);
-                    if (cdata)
-                        children.push(cdata);
-                }
+            for (const child of data.children) {
+                const cdata = child.dispatchToGeometryHandler(this);
+                if (cdata)
+                    children.push(cdata);
             }
             return children;
         }
@@ -292151,16 +292534,17 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   VertexNeighborhoodSortData: () => (/* binding */ VertexNeighborhoodSortData)
 /* 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 _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../numerics/ClusterableArray */ "../../core/geometry/lib/esm/numerics/ClusterableArray.js");
-/* harmony import */ var _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../numerics/SmallSystem */ "../../core/geometry/lib/esm/numerics/SmallSystem.js");
-/* harmony import */ var _Graph__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _HalfEdgePriorityQueue__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./HalfEdgePriorityQueue */ "../../core/geometry/lib/esm/topology/HalfEdgePriorityQueue.js");
-/* harmony import */ var _RegularizeFace__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./RegularizeFace */ "../../core/geometry/lib/esm/topology/RegularizeFace.js");
-/* harmony import */ var _Triangulation__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
+/* harmony import */ var _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../curve/CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../numerics/ClusterableArray */ "../../core/geometry/lib/esm/numerics/ClusterableArray.js");
+/* harmony import */ var _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../numerics/SmallSystem */ "../../core/geometry/lib/esm/numerics/SmallSystem.js");
+/* harmony import */ var _Graph__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
+/* harmony import */ var _HalfEdgePriorityQueue__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./HalfEdgePriorityQueue */ "../../core/geometry/lib/esm/topology/HalfEdgePriorityQueue.js");
+/* harmony import */ var _RegularizeFace__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./RegularizeFace */ "../../core/geometry/lib/esm/topology/RegularizeFace.js");
+/* harmony import */ var _Triangulation__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -292179,6 +292563,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 // cspell:word XYUV
 class GraphSplitData {
     numUpEdge = 0;
@@ -292240,11 +292625,11 @@ class HalfEdgeGraphOps {
      * @param targetB target vertex of second vector
      */
     static crossProductToTargets(base, targetA, targetB) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
     }
     /** Compute the range of the graph's vertices. */
     static graphRange(graph) {
-        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.create();
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__.Range3d.create();
         for (const node of graph.allHalfEdges) {
             range.extendXYZ(node.x, node.y, node.z);
         }
@@ -292252,7 +292637,7 @@ class HalfEdgeGraphOps {
     }
     /** Compute the xy-range of the graph's vertices. */
     static graphRangeXY(graph) {
-        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range2d.createNull();
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__.Range2d.createNull();
         for (const node of graph.allHalfEdges) {
             range.extendXY(node.x, node.y);
         }
@@ -292282,7 +292667,7 @@ class HalfEdgeGraphOps {
     static isolateAllEdges(graph) {
         for (const nodeA of graph.allHalfEdges) {
             const nodeB = nodeA.vertexPredecessor;
-            _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdge.pinch(nodeA, nodeB);
+            _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdge.pinch(nodeA, nodeB);
         }
     }
     /**
@@ -292310,7 +292695,7 @@ class HalfEdgeGraphOps {
         } while (vp !== base && vp.isMaskSet(ignore));
         if (vp === base)
             return false;
-        return _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);
+        return _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);
     }
     /**
      * Mask edges between faces if the union of the faces is convex.
@@ -292321,8 +292706,8 @@ class HalfEdgeGraphOps {
      * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.
      * @return number of edges masked (half the number of HalfEdges masked)
      */
-    static markRemovableEdgesToExpandConvexFaces(graph, mark, barrier = _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.BOUNDARY_EDGE) {
-        if (_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_MASK === mark)
+    static markRemovableEdgesToExpandConvexFaces(graph, mark, barrier = _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.BOUNDARY_EDGE) {
+        if (_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_MASK === mark)
             return 0;
         const visit = graph.grabMask(true);
         let numMarked = 0;
@@ -292330,7 +292715,7 @@ class HalfEdgeGraphOps {
             if (!node.isMaskSet(visit)) {
                 if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {
                     // tol based on areas of *original* faces on each side of the edge to be removed
-                    const signedAreaTol = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());
+                    const signedAreaTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());
                     if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {
                         node.setMaskAroundEdge(mark);
                         ++numMarked;
@@ -292350,7 +292735,7 @@ class HalfEdgeGraphOps {
      * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.
      * @return one HalfEdge per removable edge
      */
-    static collectRemovableEdgesToExpandConvexFaces(graph, barrier = _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.BOUNDARY_EDGE) {
+    static collectRemovableEdgesToExpandConvexFaces(graph, barrier = _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.BOUNDARY_EDGE) {
         const removable = [];
         const mark = graph.grabMask(true);
         if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {
@@ -292374,7 +292759,7 @@ class HalfEdgeGraphOps {
      * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.
      * @return number of edges deleted
      */
-    static expandConvexFaces(graph, barrier = _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.BOUNDARY_EDGE) {
+    static expandConvexFaces(graph, barrier = _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.BOUNDARY_EDGE) {
         const mark = graph.grabMask(true);
         const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);
         if (numRemovedEdges > 0) {
@@ -292390,7 +292775,7 @@ class HalfEdgeGraphOps {
      * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.
      * @return whether every face in the graph is convex
      */
-    static isEveryFaceConvex(graph, avoid = _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.EXTERIOR) {
+    static isEveryFaceConvex(graph, avoid = _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.EXTERIOR) {
         const allFaces = graph.collectFaceLoops();
         for (const node of allFaces) {
             if (node.isMaskedAroundFace(avoid))
@@ -292409,12 +292794,12 @@ class HalfEdgeGraphMerge {
     // return kC such that all angles k are equal, with kA <= k < kC <= kB.
     // * Assume: angles k are stored at extra data index 0.
     // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC
-    static getCommonThetaEndIndex(clusters, order, kA, kB) {
+    static getCommonThetaEndIndex(clusters, order, kA, kB, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians) {
         let kC = kA + 1;
         const thetaA = clusters.getExtraData(order[kA], 0);
         while (kC < kB) {
             const thetaB = clusters.getExtraData(order[kC], 0);
-            if (!_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
+            if (!_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {
                 return kC;
             }
             kC++;
@@ -292446,10 +292831,10 @@ class HalfEdgeGraphMerge {
     //   * only want to do anything here when curves are present.
     //   * k0<=k<k1 are around a vertex
     //   * These are sorted by theta.
-    static secondarySortAroundVertex(clusters, order, allNodes, k0, k1) {
+    static secondarySortAroundVertex(clusters, order, allNodes, k0, k1, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians) {
         const sortData = [];
         for (let k = k0; k < k1;) {
-            const kB = this.getCommonThetaEndIndex(clusters, order, k, k1);
+            const kB = this.getCommonThetaEndIndex(clusters, order, k, k1, radianTol);
             if (k + 1 < kB) {
                 sortData.length = 0;
                 for (let kA = k; kA < kB; kA++) {
@@ -292468,25 +292853,27 @@ class HalfEdgeGraphMerge {
     }
     /** Return the sort key for sorting by curvature.
      * * This is the signed distance from the curve at the edge start, to center of curvature.
+     * * ASSUME: edgeTag is a `CurveLocationDetail` whose fractions [f0,f1] define the detail.curve segment traversed
+     * by the edge. If sortData < 0, the edge traverses the curve segment in reverse order [f1,f0].
      * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.
      */
     static curvatureSortKey(node) {
-        const cld = node.edgeTag;
-        if (cld !== undefined) {
-            const fraction = cld.fraction;
-            const curve = cld.curve;
-            if (curve) {
-                let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);
-                if (node.sortData !== undefined && node.sortData < 0)
-                    radius = -radius;
-                return radius;
+        if (node.edgeTag !== undefined) {
+            if (node.edgeTag instanceof _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveLocationDetail) {
+                const cld = node.edgeTag;
+                if (cld.curve !== undefined) {
+                    const reverse = node.sortData !== undefined && node.sortData < 0;
+                    const fraction = (reverse && cld.fraction1 !== undefined) ? cld.fraction1 : cld.fraction;
+                    const radius = cld.curve.fractionToSignedXYRadiusOfCurvature(fraction);
+                    return reverse ? -radius : radius;
+                }
             }
         }
         return 0.0;
     }
     /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */
     static isNullFace(node) {
-        return node.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;
+        return node.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;
     }
     /**
      * Cluster the HalfEdges so that xy-coordinates within `mergeTolerance` are equated.
@@ -292504,23 +292891,23 @@ class HalfEdgeGraphMerge {
      * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex
      * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
+    static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians) {
         const allNodes = graph.allHalfEdges;
         const numNodes = allNodes.length;
-        graph.clearMask(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE);
-        const clusters = new _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__.ClusterableArray(2, 2, numNodes); // data order: x,y,theta,nodeIndex.  But theta is not set in first round.
+        graph.clearMask(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE);
+        const clusters = new _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_6__.ClusterableArray(2, 2, numNodes); // data block: dot,x,y,theta,nodeIndex --- dot and theta are set later
         for (let i = 0; i < numNodes; i++) {
             const nodeA = allNodes[i];
             const xA = nodeA.x;
             const yA = nodeA.y;
-            _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
+            _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
             clusters.addDirect(xA, yA, 0.0, i);
         }
-        const order = clusters.clusterIndicesLexical(clusterTol);
+        const order = clusters.clusterIndicesLexical(clusterTol); // assign primary sort dot product
         let k0 = 0;
         const numK = order.length;
         for (let k1 = 0; k1 < numK; k1++) {
-            if (order[k1] === _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__.ClusterableArray.clusterTerminator) {
+            if (order[k1] === _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_6__.ClusterableArray.clusterTerminator) {
                 // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy
                 if (k1 > k0) {
                     const iA = clusters.getExtraData(order[k0], 1);
@@ -292540,18 +292927,18 @@ class HalfEdgeGraphMerge {
         //  2) Hence ready do sort (at each vertex) by theta.
         // insert theta as extra data in the sort table . . .
         for (const clusterTableIndex of order) {
-            if (clusterTableIndex !== _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__.ClusterableArray.clusterTerminator) {
+            if (clusterTableIndex !== _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_6__.ClusterableArray.clusterTerminator) {
                 const nodeA = allNodes[clusterTableIndex];
                 const nodeB = nodeA.faceSuccessor;
                 let getPrecomputedRadians = outboundRadiansFunction;
                 if (getPrecomputedRadians) {
                     // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.
                     const detail = nodeA.edgeTag;
-                    if (undefined === detail || undefined === detail.curve || detail.curve instanceof _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_1__.LineSegment3d)
+                    if (undefined === detail || undefined === detail.curve || detail.curve instanceof _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d)
                         getPrecomputedRadians = undefined;
                 }
                 let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);
-                if (_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))
+                if (_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__.Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI, radianTol))
                     radians = Math.PI;
                 clusters.setExtraData(clusterTableIndex, 0, radians);
             }
@@ -292562,11 +292949,11 @@ class HalfEdgeGraphMerge {
         let thetaA, thetaB;
         // now pinch each neighboring pair together
         for (let k1 = 0; k1 < numK; k1++) {
-            if (order[k1] === _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__.ClusterableArray.clusterTerminator) {
-                // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.
+            if (order[k1] === _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_6__.ClusterableArray.clusterTerminator) {
+                // nodes identified in order[k0]..order[k1-1] are tentatively sorted around a vertex by theta
                 if (k1 > k0) {
                     if (k1 > k0 + 1)
-                        this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);
+                        this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1, radianTol); // finalize order by resolving ties via curvature
                     this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);
                     const iA = clusters.getExtraData(order[k0], 1);
                     thetaA = clusters.getExtraData(order[k0], 0);
@@ -292576,7 +292963,7 @@ class HalfEdgeGraphMerge {
                         const iB = clusters.getExtraData(order[k], 1);
                         thetaB = clusters.getExtraData(order[k], 0);
                         const nodeB = allNodes[iB];
-                        if (nodeA.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE)) {
+                        if (nodeA.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE)) {
                             // nope, this edge was flagged and pinched from the other end.
                             const j = unmatchedNullFaceNodes.findIndex((node) => nodeA === node);
                             if (j >= 0) {
@@ -292586,7 +292973,7 @@ class HalfEdgeGraphMerge {
                             nodeA = nodeB;
                             thetaA = thetaB;
                         }
-                        else if (nodeB.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE)) {
+                        else if (nodeB.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE)) {
                             const j = unmatchedNullFaceNodes.findIndex((node) => nodeB === node);
                             if (j >= 0) {
                                 unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];
@@ -292595,22 +292982,22 @@ class HalfEdgeGraphMerge {
                             // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.
                         }
                         else {
-                            _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdge.pinch(nodeA, nodeB);
+                            _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdge.pinch(nodeA, nodeB);
                             // Detect null face using the heuristic:
                             //  * near vertex angles are same (periodic, toleranced)
                             //  * far vertex is clustered (exactly equal)
                             //  * near vertex curvatures are same (toleranced)
                             // Note that near vertex is already clustered.
-                            if (_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
+                            if (_geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {
                                 const nodeA1 = nodeA.faceSuccessor;
                                 const nodeB1 = nodeB.edgeMate;
                                 if (nodeA1.isEqualXY(nodeB1)) {
                                     const cA = this.curvatureSortKey(nodeA);
                                     const cB = this.curvatureSortKey(nodeB);
-                                    if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(cA, cB, clusterTol)) { // rule out banana
-                                        _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdge.pinch(nodeA1, nodeB1);
-                                        nodeA.setMask(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE);
-                                        nodeB1.setMask(_Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.NULL_FACE);
+                                    if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(cA, cB, clusterTol)) { // rule out banana
+                                        _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdge.pinch(nodeA1, nodeB1);
+                                        nodeA.setMask(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE);
+                                        nodeB1.setMask(_Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.NULL_FACE);
                                         unmatchedNullFaceNodes.push(nodeB1);
                                     }
                                 }
@@ -292625,7 +293012,7 @@ class HalfEdgeGraphMerge {
         }
     }
     static buildVerticalSweepPriorityQueue(graph) {
-        const sweepHeap = new _HalfEdgePriorityQueue__WEBPACK_IMPORTED_MODULE_8__.HalfEdgePriorityQueueWithPartnerArray();
+        const sweepHeap = new _HalfEdgePriorityQueue__WEBPACK_IMPORTED_MODULE_9__.HalfEdgePriorityQueueWithPartnerArray();
         for (const p of graph.allHalfEdges) {
             if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {
                 sweepHeap.priorityQueue.push(p);
@@ -292633,19 +293020,19 @@ class HalfEdgeGraphMerge {
         }
         return sweepHeap;
     }
-    static computeIntersectionFractionsOnEdges(nodeA0, nodeB0, tol = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
+    static computeIntersectionFractionsOnEdges(nodeA0, nodeB0, tol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
         const nodeA1 = nodeA0.faceSuccessor;
         const aDir = { x: nodeA1.x - nodeA0.x, y: nodeA1.y - nodeA0.y };
         const nodeB1 = nodeB0.faceSuccessor;
         const bDir = { x: nodeB1.x - nodeB0.x, y: nodeB1.y - nodeB0.y };
-        let fractions = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_6__.SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);
+        let fractions = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_7__.SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);
         if (fractions) {
             const snapFractionToSegment = (fraction, segStart, segEnd) => {
-                const x = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(segStart.x, fraction, segEnd.x);
-                const y = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(segStart.y, fraction, segEnd.y);
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))
+                const x = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(segStart.x, fraction, segEnd.x);
+                const y = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(segStart.y, fraction, segEnd.y);
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))
                     return 0.0;
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))
                     return 1.0;
                 return fraction;
             };
@@ -292655,9 +293042,9 @@ class HalfEdgeGraphMerge {
                 fractions.f1.x = snapFractionToSegment(fractions.f1.x, nodeA0, nodeA1);
                 fractions.f1.y = snapFractionToSegment(fractions.f1.y, nodeB0, nodeB1);
             }
-            if (fractions.f1 && !(_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fractions.f1.x) && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fractions.f1.y)))
+            if (fractions.f1 && !(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isIn01(fractions.f1.x) && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isIn01(fractions.f1.y)))
                 fractions.f1 = undefined; // overlap ends beyond a segment; downgrade to simple intersection
-            if (!(_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fractions.f0.x) && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fractions.f0.y))) {
+            if (!(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isIn01(fractions.f0.x) && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isIn01(fractions.f0.y))) {
                 if (fractions.f1) {
                     fractions.f0 = fractions.f1; // overlap starts beyond a segment; downgrade to simple intersection
                     fractions.f1 = undefined;
@@ -292673,7 +293060,7 @@ class HalfEdgeGraphMerge {
      * * This is a large operation.
      * @param graph
      */
-    static splitIntersectingEdges(graph, distanceTol = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance, fractionTol = 1.0e-8) {
+    static splitIntersectingEdges(graph, distanceTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance, fractionTol = 1.0e-8) {
         const data = new GraphSplitData();
         const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);
         let nodeA0, nodeB1;
@@ -292689,10 +293076,10 @@ class HalfEdgeGraphMerge {
             for (i = 0; i < sweepHeap.activeEdges.length; i++) {
                 nodeB0 = sweepHeap.activeEdges[i];
                 nodeB1 = nodeB0.faceSuccessor;
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {
                     data.numA0B0++;
                 }
-                else if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {
+                else if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {
                     data.numA0B1++;
                 }
                 else {
@@ -292729,8 +293116,8 @@ class HalfEdgeGraphMerge {
      */
     static formGraphFromSegments(lineSegments) {
         // Structure of an index of the array: { xyTheta: Point3d, node: Node }
-        const graph = new _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraph();
-        HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.BOUNDARY_EDGE);
+        const graph = new _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeGraph();
+        HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.BOUNDARY_EDGE);
         this.splitIntersectingEdges(graph);
         this.clusterAndMergeXYTheta(graph);
         return graph;
@@ -292740,17 +293127,17 @@ class HalfEdgeGraphMerge {
      * * Graph gets full splitEdges, regularize (optional), and triangulate.
      * @returns graph, or undefined if bad data.
      */
-    static formGraphFromChains(chains, regularize = true, mask = _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeMask.PRIMARY_EDGE) {
+    static formGraphFromChains(chains, regularize = true, mask = _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeMask.PRIMARY_EDGE) {
         if (chains.length < 1)
             return undefined;
-        const graph = new _Graph__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraph();
-        const chainSeeds = _Triangulation__WEBPACK_IMPORTED_MODULE_10__.Triangulator.directCreateChainsFromCoordinates(graph, chains);
+        const graph = new _Graph__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeGraph();
+        const chainSeeds = _Triangulation__WEBPACK_IMPORTED_MODULE_11__.Triangulator.directCreateChainsFromCoordinates(graph, chains);
         for (const seed of chainSeeds)
             seed.setMaskAroundFace(mask);
         this.splitIntersectingEdges(graph);
         this.clusterAndMergeXYTheta(graph);
         if (regularize) {
-            const context = new _RegularizeFace__WEBPACK_IMPORTED_MODULE_9__.RegularizationContext(graph);
+            const context = new _RegularizeFace__WEBPACK_IMPORTED_MODULE_10__.RegularizationContext(graph);
             context.regularizeGraph(true, true);
         }
         return graph;
@@ -295567,23 +295954,9 @@ class ITwinLocalization {
             this.i18next.loadNamespaces(name, (err) => {
                 if (!err)
                     return resolve();
-                // Here we got a non-null err object.
-                // This method is called when the system has attempted to load the resources for the namespaces for each possible locale.
-                // For example 'fr-ca' might be the most specific locale, in which case 'fr' and 'en' are fallback locales.
-                // Using Backend from i18next-http-backend, err will be an array of strings of each namespace it tried to read and its locale.
-                // There might be errs for some other namespaces as well as this one. We resolve the promise unless there's an error for each possible locale.
-                let locales = this.getLanguageList().map((thisLocale) => `/${thisLocale}/`);
-                try {
-                    for (const thisError of err) {
-                        if (typeof thisError === "string")
-                            locales = locales.filter((thisLocale) => !thisError.includes(thisLocale));
-                    }
-                }
-                catch {
-                    locales = [];
-                }
-                // if we removed every locale from the array, it wasn't loaded.
-                if (locales.length === 0)
+                // i18next can return errors from other concurrent namespace loads in this callback.
+                const wasLoaded = this.getLanguageList().some((language) => this.i18next.hasResourceBundle(language, name));
+                if (!wasLoaded)
                     _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_3__.Logger.logError("i18n", `No resources for namespace ${name} could be loaded`);
                 resolve();
             });
@@ -336597,7 +336970,7 @@ class WMS {
 (module) {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.13.1","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 build:workers && npm run -s copy:draco","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run build:test-worker && vitest --run","cover":"npm run build:test-worker && vitest --run","build:test-worker":"vite build --config ./src/test/worker/vite.config.mts 1>&2","build:workers":"rimraf lib/workers/webpack && vite build --config ./src/workers/ImdlParser/vite.config.mts 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:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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":{"@bentley/aec-units-schema":"^1.0.3","@bentley/formats-schema":"^1.0.0","@bentley/units-schema":"^1.0.11","@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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"^3.0.4","@itwin/eslint-plugin":"^6.0.0","@types/node":"~20.17.0","@types/sinon":"^17.0.2","@vitest/browser-playwright":"^4.1.10","@vitest/coverage-v8":"^4.1.10","cpx2":"^8.0.0","eslint":"^9.31.0","playwright":"~1.56.1","rimraf":"^6.0.1","sinon":"^17.0.2","typescript":"~5.6.2","vite":"^6.4.3","vitest":"^4.1.10","vite-plugin-static-copy":"2.2.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/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"~4.3.4","@loaders.gl/draco":"~4.3.4","fuse.js":"^3.3.0","wms-capabilities":"0.6.0"}}');
+module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.14.0-dev.10","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 build:workers && npm run -s copy:draco","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run build:test-worker && vitest --run","cover":"npm run build:test-worker && vitest --run","build:test-worker":"vite build --config ./src/test/worker/vite.config.mts 1>&2","build:workers":"rimraf lib/workers/webpack && vite build --config ./src/workers/ImdlParser/vite.config.mts 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:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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":{"@bentley/aec-units-schema":"^1.0.3","@bentley/formats-schema":"^1.0.0","@bentley/units-schema":"^1.0.11","@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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"^3.0.4","@itwin/eslint-plugin":"^6.0.0","@types/node":"~20.17.0","@types/sinon":"^17.0.2","@vitest/browser-playwright":"^4.1.10","@vitest/coverage-v8":"^4.1.10","cpx2":"^8.0.0","eslint":"^9.31.0","playwright":"~1.56.1","rimraf":"^6.0.1","sinon":"^17.0.2","typescript":"~5.6.2","vite":"^6.4.3","vitest":"^4.1.10","vite-plugin-static-copy":"2.2.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/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^4.4.5","@loaders.gl/draco":"^4.4.5","fuse.js":"^3.3.0","wms-capabilities":"0.6.0"}}');
 
 /***/ }