@itwin/core-bentley 3.6.0-dev.8 → 3.6.1

package/lib/esm/core-bentley.js

@@ -1,80 +1,79 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-export * from "./AccessToken";
-export * from "./Assert";
-export * from "./AsyncMutex";
-export * from "./BeEvent";
-export * from "./BentleyError";
-export * from "./BentleyLoggerCategory";
-export * from "./StatusCategory";
-export * from "./BeSQLite";
-export * from "./ByteStream";
-export * from "./ClassUtils";
-export * from "./Compare";
-export * from "./CompressedId64Set";
-export * from "./Dictionary";
-export * from "./Disposable";
-export * from "./Id";
-export * from "./IndexMap";
-export * from "./JsonSchema";
-export * from "./JsonUtils";
-export * from "./Logger";
-export * from "./LRUMap";
-export * from "./ObservableSet";
-export * from "./OneAtATimeAction";
-export * from "./OrderedId64Iterable";
-export * from "./OrderedSet";
-export * from "./partitionArray";
-export * from "./PriorityQueue";
-export * from "./ProcessDetector";
-export * from "./SortedArray";
-export * from "./StringUtils";
-export * from "./Time";
-export * from "./Tracing";
-export * from "./TupleKeyedMap";
-export * from "./TypedArrayBuilder";
-export * from "./UnexpectedErrors";
-export * from "./UtilityTypes";
-export * from "./YieldManager";
-/** @docs-package-description
- * The core-bentley package contains classes to solve problems that are common for both client and server use cases.
- */
-/**
- * @docs-group-description BeSQLite
- * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)
- */
-/**
- * @docs-group-description Errors
- * Classes for working with errors.
- */
-/**
- * @docs-group-description Events
- * Classes for raising and handling events.
- */
-/**
- * @docs-group-description Ids
- * Classes for working with unique identifiers.
- */
-/**
- * @docs-group-description Logging
- * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)
- */
-/**
- * @docs-group-description Collections
- * Specialized, customizable collection classes like priority queues.
- */
-/**
- * @docs-group-description Json
- * utilities for dealing with Json strings and files.
- */
-/**
- * @docs-group-description Utils
- * Miscellaneous utility classes.
- */
-/**
- * @docs-group-description ProcessDetector
- * Functions for determining the type of the current JavaScript process.
- */
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+export * from "./AccessToken";
+export * from "./Assert";
+export * from "./BeEvent";
+export * from "./BentleyError";
+export * from "./BentleyLoggerCategory";
+export * from "./StatusCategory";
+export * from "./BeSQLite";
+export * from "./ByteStream";
+export * from "./ClassUtils";
+export * from "./Compare";
+export * from "./CompressedId64Set";
+export * from "./Dictionary";
+export * from "./Disposable";
+export * from "./Id";
+export * from "./IndexMap";
+export * from "./JsonSchema";
+export * from "./JsonUtils";
+export * from "./Logger";
+export * from "./LRUMap";
+export * from "./ObservableSet";
+export * from "./OneAtATimeAction";
+export * from "./OrderedId64Iterable";
+export * from "./OrderedSet";
+export * from "./partitionArray";
+export * from "./PriorityQueue";
+export * from "./ProcessDetector";
+export * from "./SortedArray";
+export * from "./StringUtils";
+export * from "./Time";
+export * from "./Tracing";
+export * from "./TupleKeyedMap";
+export * from "./TypedArrayBuilder";
+export * from "./UnexpectedErrors";
+export * from "./UtilityTypes";
+export * from "./YieldManager";
+/** @docs-package-description
+ * The core-bentley package contains classes to solve problems that are common for both client and server use cases.
+ */
+/**
+ * @docs-group-description BeSQLite
+ * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)
+ */
+/**
+ * @docs-group-description Errors
+ * Classes for working with errors.
+ */
+/**
+ * @docs-group-description Events
+ * Classes for raising and handling events.
+ */
+/**
+ * @docs-group-description Ids
+ * Classes for working with unique identifiers.
+ */
+/**
+ * @docs-group-description Logging
+ * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)
+ */
+/**
+ * @docs-group-description Collections
+ * Specialized, customizable collection classes like priority queues.
+ */
+/**
+ * @docs-group-description Json
+ * utilities for dealing with Json strings and files.
+ */
+/**
+ * @docs-group-description Utils
+ * Miscellaneous utility classes.
+ */
+/**
+ * @docs-group-description ProcessDetector
+ * Functions for determining the type of the current JavaScript process.
+ */
 //# sourceMappingURL=core-bentley.js.map

package/lib/esm/core-bentley.js.map

@@ -1 +1 @@
-{"version":3,"file":"core-bentley.js","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,yBAAyB,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,MAAM,CAAC;AACrB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAE/B;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\nexport * from \"./AccessToken\";\r\nexport * from \"./Assert\";\r\nexport * from \"./AsyncMutex\";\r\nexport * from \"./BeEvent\";\r\nexport * from \"./BentleyError\";\r\nexport * from \"./BentleyLoggerCategory\";\r\nexport * from \"./StatusCategory\";\r\nexport * from \"./BeSQLite\";\r\nexport * from \"./ByteStream\";\r\nexport * from \"./ClassUtils\";\r\nexport * from \"./Compare\";\r\nexport * from \"./CompressedId64Set\";\r\nexport * from \"./Dictionary\";\r\nexport * from \"./Disposable\";\r\nexport * from \"./Id\";\r\nexport * from \"./IndexMap\";\r\nexport * from \"./JsonSchema\";\r\nexport * from \"./JsonUtils\";\r\nexport * from \"./Logger\";\r\nexport * from \"./LRUMap\";\r\nexport * from \"./ObservableSet\";\r\nexport * from \"./OneAtATimeAction\";\r\nexport * from \"./OrderedId64Iterable\";\r\nexport * from \"./OrderedSet\";\r\nexport * from \"./partitionArray\";\r\nexport * from \"./PriorityQueue\";\r\nexport * from \"./ProcessDetector\";\r\nexport * from \"./SortedArray\";\r\nexport * from \"./StringUtils\";\r\nexport * from \"./Time\";\r\nexport * from \"./Tracing\";\r\nexport * from \"./TupleKeyedMap\";\r\nexport * from \"./TypedArrayBuilder\";\r\nexport * from \"./UnexpectedErrors\";\r\nexport * from \"./UtilityTypes\";\r\nexport * from \"./YieldManager\";\r\n\r\n/** @docs-package-description\r\n * The core-bentley package contains classes to solve problems that are common for both client and server use cases.\r\n */\r\n/**\r\n * @docs-group-description BeSQLite\r\n * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)\r\n */\r\n/**\r\n * @docs-group-description Errors\r\n * Classes for working with errors.\r\n */\r\n/**\r\n * @docs-group-description Events\r\n * Classes for raising and handling events.\r\n */\r\n/**\r\n * @docs-group-description Ids\r\n * Classes for working with unique identifiers.\r\n */\r\n/**\r\n * @docs-group-description Logging\r\n * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)\r\n */\r\n/**\r\n * @docs-group-description Collections\r\n * Specialized, customizable collection classes like priority queues.\r\n */\r\n/**\r\n * @docs-group-description Json\r\n * utilities for dealing with Json strings and files.\r\n */\r\n/**\r\n * @docs-group-description Utils\r\n * Miscellaneous utility classes.\r\n */\r\n/**\r\n * @docs-group-description ProcessDetector\r\n * Functions for determining the type of the current JavaScript process.\r\n */\r\n"]}
+{"version":3,"file":"core-bentley.js","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,yBAAyB,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,WAAW,CAAC;AAC1B,cAAc,qBAAqB,CAAC;AACpC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,MAAM,CAAC;AACrB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,uBAAuB,CAAC;AACtC,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAE/B;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nexport * from \"./AccessToken\";\nexport * from \"./Assert\";\nexport * from \"./BeEvent\";\nexport * from \"./BentleyError\";\nexport * from \"./BentleyLoggerCategory\";\nexport * from \"./StatusCategory\";\nexport * from \"./BeSQLite\";\nexport * from \"./ByteStream\";\nexport * from \"./ClassUtils\";\nexport * from \"./Compare\";\nexport * from \"./CompressedId64Set\";\nexport * from \"./Dictionary\";\nexport * from \"./Disposable\";\nexport * from \"./Id\";\nexport * from \"./IndexMap\";\nexport * from \"./JsonSchema\";\nexport * from \"./JsonUtils\";\nexport * from \"./Logger\";\nexport * from \"./LRUMap\";\nexport * from \"./ObservableSet\";\nexport * from \"./OneAtATimeAction\";\nexport * from \"./OrderedId64Iterable\";\nexport * from \"./OrderedSet\";\nexport * from \"./partitionArray\";\nexport * from \"./PriorityQueue\";\nexport * from \"./ProcessDetector\";\nexport * from \"./SortedArray\";\nexport * from \"./StringUtils\";\nexport * from \"./Time\";\nexport * from \"./Tracing\";\nexport * from \"./TupleKeyedMap\";\nexport * from \"./TypedArrayBuilder\";\nexport * from \"./UnexpectedErrors\";\nexport * from \"./UtilityTypes\";\nexport * from \"./YieldManager\";\n\n/** @docs-package-description\n * The core-bentley package contains classes to solve problems that are common for both client and server use cases.\n */\n/**\n * @docs-group-description BeSQLite\n * Classes for working with SQLite databases. SQLite underlies IModelDb and ECDb - see [Executing ECSQL]($docs/learning/ECSQL.md)\n */\n/**\n * @docs-group-description Errors\n * Classes for working with errors.\n */\n/**\n * @docs-group-description Events\n * Classes for raising and handling events.\n */\n/**\n * @docs-group-description Ids\n * Classes for working with unique identifiers.\n */\n/**\n * @docs-group-description Logging\n * Classes for configuring and logging diagnostic messages - see [Learning about Logging]($docs/learning/common/Logging.md)\n */\n/**\n * @docs-group-description Collections\n * Specialized, customizable collection classes like priority queues.\n */\n/**\n * @docs-group-description Json\n * utilities for dealing with Json strings and files.\n */\n/**\n * @docs-group-description Utils\n * Miscellaneous utility classes.\n */\n/**\n * @docs-group-description ProcessDetector\n * Functions for determining the type of the current JavaScript process.\n */\n"]}

package/lib/esm/partitionArray.d.ts

@@ -1,22 +1,22 @@
-/** @packageDocumentation
- * @module Collections
- */
-/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
- * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
- * @param array The array to be partitioned.
- * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
- * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
- * @note The relative ordering of elements within each partition is unspecified.
- * Example:
- * ```ts
- * function isEven(n: number) { return 0 === n % 2; }
- * const list = [ 1, 2, 3, 4, 5 ];
- * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
- * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
- * for (let i = 0; i < list.length; i++)
- *   assert(isEven(list[i]) === i < firstOddIndex);
- * ```
- * @public
- */
-export declare function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number;
+/** @packageDocumentation
+ * @module Collections
+ */
+/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
+ * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
+ * @param array The array to be partitioned.
+ * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
+ * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
+ * @note The relative ordering of elements within each partition is unspecified.
+ * Example:
+ * ```ts
+ * function isEven(n: number) { return 0 === n % 2; }
+ * const list = [ 1, 2, 3, 4, 5 ];
+ * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
+ * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
+ * for (let i = 0; i < list.length; i++)
+ *   assert(isEven(list[i]) === i < firstOddIndex);
+ * ```
+ * @public
+ */
+export declare function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number;
 //# sourceMappingURL=partitionArray.d.ts.map

package/lib/esm/partitionArray.js

@@ -1,40 +1,40 @@
-/*---------------------------------------------------------------------------------------------
-* 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
- */
-/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
- * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
- * @param array The array to be partitioned.
- * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
- * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
- * @note The relative ordering of elements within each partition is unspecified.
- * Example:
- * ```ts
- * function isEven(n: number) { return 0 === n % 2; }
- * const list = [ 1, 2, 3, 4, 5 ];
- * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
- * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
- * for (let i = 0; i < list.length; i++)
- *   assert(isEven(list[i]) === i < firstOddIndex);
- * ```
- * @public
- */
-export function partitionArray(array, criterion) {
-    let index = 0;
-    let partition = array.length;
-    while (index < partition) {
-        const elem = array[index];
-        if (criterion(elem)) {
-            ++index;
-        }
-        else {
-            array[index] = array[--partition];
-            array[partition] = elem;
-        }
-    }
-    return partition;
-}
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower
+ * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.
+ * @param array The array to be partitioned.
+ * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.
+ * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.
+ * @note The relative ordering of elements within each partition is unspecified.
+ * Example:
+ * ```ts
+ * function isEven(n: number) { return 0 === n % 2; }
+ * const list = [ 1, 2, 3, 4, 5 ];
+ * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2
+ * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.
+ * for (let i = 0; i < list.length; i++)
+ *   assert(isEven(list[i]) === i < firstOddIndex);
+ * ```
+ * @public
+ */
+export function partitionArray(array, criterion) {
+    let index = 0;
+    let partition = array.length;
+    while (index < partition) {
+        const elem = array[index];
+        if (criterion(elem)) {
+            ++index;
+        }
+        else {
+            array[index] = array[--partition];
+            array[partition] = elem;
+        }
+    }
+    return partition;
+}
 //# sourceMappingURL=partitionArray.js.map

package/lib/esm/partitionArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,EAAE,KAAK,CAAC;SACT;aAAM;YACL,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;SACzB;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\r\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\r\n * @param array The array to be partitioned.\r\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\r\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\r\n * @note The relative ordering of elements within each partition is unspecified.\r\n * Example:\r\n * ```ts\r\n * function isEven(n: number) { return 0 === n % 2; }\r\n * const list = [ 1, 2, 3, 4, 5 ];\r\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\r\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\r\n * for (let i = 0; i < list.length; i++)\r\n *   assert(isEven(list[i]) === i < firstOddIndex);\r\n * ```\r\n * @public\r\n */\r\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\r\n  let index = 0;\r\n  let partition = array.length;\r\n  while (index < partition) {\r\n    const elem = array[index];\r\n    if (criterion(elem)) {\r\n      ++index;\r\n    } else {\r\n      array[index] = array[--partition];\r\n      array[partition] = elem;\r\n    }\r\n  }\r\n\r\n  return partition;\r\n}\r\n"]}
+{"version":3,"file":"partitionArray.js","sourceRoot":"","sources":["../../src/partitionArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAkC;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,OAAO,KAAK,GAAG,SAAS,EAAE;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;YACnB,EAAE,KAAK,CAAC;SACT;aAAM;YACL,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;YAClC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC;SACzB;KACF;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\n/** Partitions an array in-place according to some criterion, such that elements that fulfill the criterion are grouped in the lower\n * portion of the array, and those that fail to fulfill the criterion are grouped in the upper portion of the array.\n * @param array The array to be partitioned.\n * @param criterion A function invoked for each element of the array, returning whether the element fulfills the criterion.\n * @returns The index of the upper partition, i.e., of the first element that fails the criterion. If all elements fulfill the criterion, this is the length of the array.\n * @note The relative ordering of elements within each partition is unspecified.\n * Example:\n * ```ts\n * function isEven(n: number) { return 0 === n % 2; }\n * const list = [ 1, 2, 3, 4, 5 ];\n * const firstOddIndex = partitionArray(list, isEven); // firstOddIndex = 2\n * // 2 and 4 now appear before 1, 3, and 5 in the list; their ordering is otherwise unspecified.\n * for (let i = 0; i < list.length; i++)\n *   assert(isEven(list[i]) === i < firstOddIndex);\n * ```\n * @public\n */\nexport function partitionArray<T>(array: T[], criterion: (element: T) => boolean): number {\n  let index = 0;\n  let partition = array.length;\n  while (index < partition) {\n    const elem = array[index];\n    if (criterion(elem)) {\n      ++index;\n    } else {\n      array[index] = array[--partition];\n      array[partition] = elem;\n    }\n  }\n\n  return partition;\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/core-bentley",
-  "version": "3.6.0-dev.8",
+  "version": "3.6.1",
   "description": "Bentley JavaScript core components",
   "main": "lib/cjs/core-bentley.js",
   "module": "lib/esm/core-bentley.js",
@@ -21,8 +21,8 @@
     "url": "http://www.bentley.com"
   },
   "devDependencies": {
-    "@itwin/build-tools": "3.6.0-dev.8",
-    "@itwin/eslint-plugin": "3.6.0-dev.8",
+    "@itwin/build-tools": "3.6.1",
+    "@itwin/eslint-plugin": "3.6.1",
     "@opentelemetry/api": "1.0.4",
     "@types/chai": "4.3.1",
     "@types/chai-as-promised": "^7",

package/lib/cjs/AsyncMutex.d.ts

@@ -1,27 +0,0 @@
-/** @packageDocumentation
- * @module Utils
- */
-/**
- * Type of method to unlock the held mutex
- * @see [[AsyncMutex]]
- * @alpha
- */
-export declare type AsyncMutexUnlockFnType = () => void;
-/**
- * Utility to ensure a block of async code executes atomically.
- * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for
- * race conditions with async code. This utility is needed in cases where a block of async code needs to run
- * to completion before another block is started.
- * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/
- * @alpha
- */
-export declare class AsyncMutex {
-    private _mutex;
-    /**
-     * Await the return value to setup a lock. The return value
-     * is also the unlock function that can be called to unlock
-     * the mutex.
-     */
-    lock(): Promise<AsyncMutexUnlockFnType>;
-}
-//# sourceMappingURL=AsyncMutex.d.ts.map

package/lib/cjs/AsyncMutex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AsyncMutex.d.ts","sourceRoot":"","sources":["../../src/AsyncMutex.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;GAIG;AACH,oBAAY,sBAAsB,GAAG,MAAM,IAAI,CAAC;AAEhD;;;;;;;GAOG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAqB;IAEnC;;;;OAIG;IACU,IAAI,IAAI,OAAO,CAAC,sBAAsB,CAAC;CAgBrD"}

package/lib/cjs/AsyncMutex.js

@@ -1,44 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Utils
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AsyncMutex = void 0;
-/**
- * Utility to ensure a block of async code executes atomically.
- * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for
- * race conditions with async code. This utility is needed in cases where a block of async code needs to run
- * to completion before another block is started.
- * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/
- * @alpha
- */
-class AsyncMutex {
-    constructor() {
-        this._mutex = Promise.resolve();
-    }
-    /**
-     * Await the return value to setup a lock. The return value
-     * is also the unlock function that can be called to unlock
-     * the mutex.
-     */
-    async lock() {
-        /**
-         * Note: The promise returned by this method will resolve (with the unlock function, which is actually the
-         * mutex’s then’s resolve function) once any previous mutexes have finished and called their
-         * respective unlock function that was yielded over their promise.
-         */
-        let begin = (_unlock) => { };
-        this._mutex = this._mutex.then(async () => {
-            return new Promise(begin);
-        });
-        return new Promise((res) => {
-            begin = res;
-        });
-    }
-}
-exports.AsyncMutex = AsyncMutex;
-//# sourceMappingURL=AsyncMutex.js.map

package/lib/cjs/AsyncMutex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"AsyncMutex.js","sourceRoot":"","sources":["../../src/AsyncMutex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AASH;;;;;;;GAOG;AACH,MAAa,UAAU;IAAvB;QACU,WAAM,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAuBrC,CAAC;IArBC;;;;OAIG;IACI,KAAK,CAAC,IAAI;QACf;;;;WAIG;QACH,IAAI,KAAK,GAA6C,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;QAEvE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,IAAmB,EAAE;YACvD,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACzB,KAAK,GAAG,GAAG,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAxBD,gCAwBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\n/**\r\n * Type of method to unlock the held mutex\r\n * @see [[AsyncMutex]]\r\n * @alpha\r\n */\r\nexport type AsyncMutexUnlockFnType = () => void;\r\n\r\n/**\r\n * Utility to ensure a block of async code executes atomically.\r\n * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for\r\n * race conditions with async code. This utility is needed in cases where a block of async code needs to run\r\n * to completion before another block is started.\r\n * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/\r\n * @alpha\r\n */\r\nexport class AsyncMutex {\r\n  private _mutex = Promise.resolve();\r\n\r\n  /**\r\n   * Await the return value to setup a lock. The return value\r\n   * is also the unlock function that can be called to unlock\r\n   * the mutex.\r\n   */\r\n  public async lock(): Promise<AsyncMutexUnlockFnType> {\r\n    /**\r\n     * Note: The promise returned by this method will resolve (with the unlock function, which is actually the\r\n     * mutex’s then’s resolve function) once any previous mutexes have finished and called their\r\n     * respective unlock function that was yielded over their promise.\r\n     */\r\n    let begin: (unlock: AsyncMutexUnlockFnType) => void = (_unlock) => { };\r\n\r\n    this._mutex = this._mutex.then(async (): Promise<void> => {\r\n      return new Promise(begin);\r\n    });\r\n\r\n    return new Promise((res) => {\r\n      begin = res;\r\n    });\r\n  }\r\n}\r\n"]}

package/lib/esm/AsyncMutex.d.ts

@@ -1,27 +0,0 @@
-/** @packageDocumentation
- * @module Utils
- */
-/**
- * Type of method to unlock the held mutex
- * @see [[AsyncMutex]]
- * @alpha
- */
-export declare type AsyncMutexUnlockFnType = () => void;
-/**
- * Utility to ensure a block of async code executes atomically.
- * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for
- * race conditions with async code. This utility is needed in cases where a block of async code needs to run
- * to completion before another block is started.
- * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/
- * @alpha
- */
-export declare class AsyncMutex {
-    private _mutex;
-    /**
-     * Await the return value to setup a lock. The return value
-     * is also the unlock function that can be called to unlock
-     * the mutex.
-     */
-    lock(): Promise<AsyncMutexUnlockFnType>;
-}
-//# sourceMappingURL=AsyncMutex.d.ts.map

package/lib/esm/AsyncMutex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AsyncMutex.d.ts","sourceRoot":"","sources":["../../src/AsyncMutex.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;GAIG;AACH,oBAAY,sBAAsB,GAAG,MAAM,IAAI,CAAC;AAEhD;;;;;;;GAOG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAqB;IAEnC;;;;OAIG;IACU,IAAI,IAAI,OAAO,CAAC,sBAAsB,CAAC;CAgBrD"}

package/lib/esm/AsyncMutex.js

@@ -1,40 +0,0 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Utils
- */
-/**
- * Utility to ensure a block of async code executes atomically.
- * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for
- * race conditions with async code. This utility is needed in cases where a block of async code needs to run
- * to completion before another block is started.
- * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/
- * @alpha
- */
-export class AsyncMutex {
-    constructor() {
-        this._mutex = Promise.resolve();
-    }
-    /**
-     * Await the return value to setup a lock. The return value
-     * is also the unlock function that can be called to unlock
-     * the mutex.
-     */
-    async lock() {
-        /**
-         * Note: The promise returned by this method will resolve (with the unlock function, which is actually the
-         * mutex’s then’s resolve function) once any previous mutexes have finished and called their
-         * respective unlock function that was yielded over their promise.
-         */
-        let begin = (_unlock) => { };
-        this._mutex = this._mutex.then(async () => {
-            return new Promise(begin);
-        });
-        return new Promise((res) => {
-            begin = res;
-        });
-    }
-}
-//# sourceMappingURL=AsyncMutex.js.map

package/lib/esm/AsyncMutex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"AsyncMutex.js","sourceRoot":"","sources":["../../src/AsyncMutex.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AASH;;;;;;;GAOG;AACH,MAAM,OAAO,UAAU;IAAvB;QACU,WAAM,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAuBrC,CAAC;IArBC;;;;OAIG;IACI,KAAK,CAAC,IAAI;QACf;;;;WAIG;QACH,IAAI,KAAK,GAA6C,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;QAEvE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,IAAmB,EAAE;YACvD,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YACzB,KAAK,GAAG,GAAG,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\n/**\r\n * Type of method to unlock the held mutex\r\n * @see [[AsyncMutex]]\r\n * @alpha\r\n */\r\nexport type AsyncMutexUnlockFnType = () => void;\r\n\r\n/**\r\n * Utility to ensure a block of async code executes atomically.\r\n * Even if JavaScript precludes the possibility of race conditions between threads, there is potential for\r\n * race conditions with async code. This utility is needed in cases where a block of async code needs to run\r\n * to completion before another block is started.\r\n * This utility was based on this article: https://spin.atomicobject.com/2018/09/10/javascript-concurrency/\r\n * @alpha\r\n */\r\nexport class AsyncMutex {\r\n  private _mutex = Promise.resolve();\r\n\r\n  /**\r\n   * Await the return value to setup a lock. The return value\r\n   * is also the unlock function that can be called to unlock\r\n   * the mutex.\r\n   */\r\n  public async lock(): Promise<AsyncMutexUnlockFnType> {\r\n    /**\r\n     * Note: The promise returned by this method will resolve (with the unlock function, which is actually the\r\n     * mutex’s then’s resolve function) once any previous mutexes have finished and called their\r\n     * respective unlock function that was yielded over their promise.\r\n     */\r\n    let begin: (unlock: AsyncMutexUnlockFnType) => void = (_unlock) => { };\r\n\r\n    this._mutex = this._mutex.then(async (): Promise<void> => {\r\n      return new Promise(begin);\r\n    });\r\n\r\n    return new Promise((res) => {\r\n      begin = res;\r\n    });\r\n  }\r\n}\r\n"]}