@itwin/core-bentley 5.2.0-dev.3 → 5.2.0-dev.31

package/CHANGELOG.md

@@ -1,6 +1,55 @@
 # Change Log - @itwin/core-bentley
 
-This log was last generated on Wed, 06 Aug 2025 15:37:23 GMT and should not be manually modified.
+This log was last generated on Wed, 17 Sep 2025 17:22:50 GMT and should not be manually modified.
+
+## 5.1.8
+Wed, 17 Sep 2025 17:17:16 GMT
+
+_Version update only_
+
+## 5.1.7
+Tue, 09 Sep 2025 19:28:04 GMT
+
+_Version update only_
+
+## 5.1.6
+Mon, 08 Sep 2025 13:53:47 GMT
+
+_Version update only_
+
+## 5.1.5
+Thu, 04 Sep 2025 13:51:08 GMT
+
+_Version update only_
+
+## 5.1.4
+Fri, 22 Aug 2025 14:22:33 GMT
+
+_Version update only_
+
+## 5.1.3
+Wed, 20 Aug 2025 13:57:10 GMT
+
+_Version update only_
+
+## 5.1.2
+Thu, 14 Aug 2025 19:38:08 GMT
+
+_Version update only_
+
+## 5.1.1
+Fri, 08 Aug 2025 18:06:10 GMT
+
+_Version update only_
+
+## 5.1.0
+Fri, 08 Aug 2025 12:51:53 GMT
+
+### Updates
+
+- Add TypeScript utility types `DeepReadonlyObject` and `DeepRequiredObject`.
+- Add compareArrays for ordered comparison of arrays.
+- Updated deprecation comments to new template
 
 ## 5.0.5
 Wed, 06 Aug 2025 15:34:15 GMT

package/lib/cjs/Expect.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Expects that a value is defined (not undefined).
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle undefined values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is defined.
+ * @throws Error if the value is undefined.
+ * @internal
+ */
+export declare function expectDefined<T>(value: T | undefined, message?: string): T;
+/**
+ * Expects that a value is not null.
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle null values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is not null.
+ * @throws Error if the value is null.
+ * @internal
+ */
+export declare function expectNotNull<T>(value: T | null, message?: string): T;
+//# sourceMappingURL=Expect.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Expect.d.ts","sourceRoot":"","sources":["../../src/Expect.ts"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,CAAC,CAK1E;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,CAAC,CAKrE"}

package/lib/cjs/Expect.js

@@ -0,0 +1,41 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.expectDefined = expectDefined;
+exports.expectNotNull = expectNotNull;
+/**
+ * Expects that a value is defined (not undefined).
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle undefined values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is defined.
+ * @throws Error if the value is undefined.
+ * @internal
+ */
+function expectDefined(value, message) {
+    if (value === undefined) {
+        throw new Error(message ?? "Expected value to be defined, but it was undefined.");
+    }
+    return value;
+}
+/**
+ * Expects that a value is not null.
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle null values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is not null.
+ * @throws Error if the value is null.
+ * @internal
+ */
+function expectNotNull(value, message) {
+    if (value === null) {
+        throw new Error(message ?? "Expected value to be not null, but it was null.");
+    }
+    return value;
+}
+//# sourceMappingURL=Expect.js.map

package/lib/cjs/Expect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Expect.js","sourceRoot":"","sources":["../../src/Expect.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;AAY/F,sCAKC;AAYD,sCAKC;AAhCD;;;;;;;;;GASG;AACH,SAAgB,aAAa,CAAI,KAAoB,EAAE,OAAgB;IACrE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,qDAAqD,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,aAAa,CAAI,KAAe,EAAE,OAAgB;IAChE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,iDAAiD,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,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\n/**\n * Expects that a value is defined (not undefined).\n * @note Almost always, places that use this function should in the future be cleaned up to properly\n * handle undefined values instead of throwing an error.\n * @param value The value to check.\n * @param message Optional error message to be used in thrown Error.\n * @returns The original value if it is defined.\n * @throws Error if the value is undefined.\n * @internal\n */\nexport function expectDefined<T>(value: T | undefined, message?: string): T {\n  if (value === undefined) {\n    throw new Error(message ?? \"Expected value to be defined, but it was undefined.\");\n  }\n  return value;\n}\n\n/**\n * Expects that a value is not null.\n * @note Almost always, places that use this function should in the future be cleaned up to properly\n * handle null values instead of throwing an error.\n * @param value The value to check.\n * @param message Optional error message to be used in thrown Error.\n * @returns The original value if it is not null.\n * @throws Error if the value is null.\n * @internal\n */\nexport function expectNotNull<T>(value: T | null, message?: string): T {\n  if (value === null) {\n    throw new Error(message ?? \"Expected value to be not null, but it was null.\");\n  }\n  return value;\n}\n"]}

package/lib/cjs/LRUMap.js

@@ -311,7 +311,7 @@ class LRUCache {
         let s = "";
         let entry = this.oldest;
         while (entry) {
-            s += `${String(entry.key)}:${entry.value}`;
+            s += `${String(entry.key)}:${String(entry.value)}`;
             entry = entry.newer;
             if (entry) {
                 s += " < ";

package/lib/cjs/LRUMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,6CAA0C;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAa,KAAK;IAGG;IAAe;IAF3B,KAAK,CAAe;IACpB,KAAK,CAAe;IAC3B,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAJD,sBAIC;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IACP,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,QAAQ;IACX,UAAU,CAAuB;IAEzC,8BAA8B;IACvB,IAAI,CAAS;IAEpB,kDAAkD;IAC3C,KAAK,CAAS;IAErB,qEAAqE;IAC9D,MAAM,CAAe;IAE5B,oEAAoE;IAC7D,MAAM,CAAe;IAE5B;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;YAC5B,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;QACxC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAChB,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAC1B,CAAC;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO;QAET,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAClC,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,CAAC,CAAC,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxC,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO,GAAG,IAAI,CAAC,CAAC,uDAAuD;QACzE,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,IAAI,KAAK,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AA3PD,4BA2PC;AAED;;GAEG;AACH,MAAa,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAPD,wBAOC;AAED;;GAEG;AACH,MAAa,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,uBAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF;AATD,sCASC","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\nimport { OrderedComparator } from \"./Compare\";\nimport { Dictionary } from \"./Dictionary\";\n\n/**\n * Derived from:\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md at https://github.com/rsms/js-lru for details.\n */\n\n/** An entry holds the key and value, and pointers to any older and newer entries.\n * @public\n */\nexport class Entry<K, V> {\n  public newer?: Entry<K, V>;\n  public older?: Entry<K, V>;\n  constructor(public key: K, public value: V) { }\n}\n\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    const val: [K, V] = [ent.key, ent.value];\n    return { done: false, value: val };\n  }\n}\n\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.key };\n  }\n}\n\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.value };\n  }\n}\n\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\n * Compatible with a [[Dictionary]] or a standard Map.\n * @public\n */\nexport interface EntryContainer<K, V> {\n  readonly size: number;\n  clear(): void;\n  get(key: K): Entry<K, V> | undefined;\n  set(key: K, value: Entry<K, V>): void;\n  has(key: K): boolean;\n  delete(key: K): void;\n}\n\n/**\n * A mapping of a key/value pairs, where the size of the cache can be limited.\n *\n * When entries are inserted, if the cache is \"full\", the\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\n *\n * Illustration of the design:\n *\n * ```\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n * ```\n * @public\n */\nexport class LRUCache<K, V> {\n  private _container: EntryContainer<K, V>;\n\n  /** Current number of items */\n  public size: number;\n\n  /** Maximum number of items this cache can hold */\n  public limit: number;\n\n  /** Least recently-used entry. Invalidated when cache is modified. */\n  public oldest?: Entry<K, V>;\n\n  /** Most recently-used entry. Invalidated when cache is modified. */\n  public newest?: Entry<K, V>;\n\n  /**\n   * Construct a new LRUCache to hold up to `limit` entries.\n   */\n  public constructor(limit: number, container: EntryContainer<K, V>) {\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._container = container;\n  }\n\n  private markEntryAsUsed(entry: Entry<K, V>) {\n    if (entry === this.newest)\n      return; // Already the most recently used entry, so no need to update the list\n\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry.newer) {\n      if (entry === this.oldest) {\n        this.oldest = entry.newer;\n      }\n      entry.newer.older = entry.older; // C <-- E.\n    }\n    if (entry.older) {\n      entry.older.newer = entry.newer; // C. --> E\n    }\n    entry.newer = undefined; // D --x\n    entry.older = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest.newer = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\n  public assign(entries: Iterable<[K, V]>): void {\n    let entry;\n    let limit = this.limit || Number.MAX_VALUE;\n    this._container.clear();\n    const it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      const e = new Entry(itv.value[0], itv.value[1]);\n      this._container.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry.newer = e;\n        e.older = entry;\n      }\n      entry = e;\n      if (limit-- === 0) {\n        throw new Error(\"overflow\");\n      }\n    }\n    this.newest = entry;\n    this.size = this._container.size;\n  }\n\n  /** Get and register recent use of <key>.\n   *  Returns the value associated with <key> or undefined if not in cache.\n   */\n  public get(key: K): V | undefined {\n    // First, find our cache entry\n    const entry = this._container.get(key);\n    if (!entry)\n      return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this.markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\n   *  @returns `this`.\n   */\n  public set(key: K, value: V): LRUCache<K, V> {\n    let entry = this._container.get(key);\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this.markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._container.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest.newer = entry;\n      entry.older = this.newest;\n    } else {\n      // we're first in\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it is now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n    return this;\n  }\n\n  /**  Purge the least recently used (oldest) entry from the cache.\n   *  @returns The removed entry or undefined if the cache was empty.\n   */\n  public shift(): [K, V] | undefined {\n    const entry = this.oldest;\n    if (entry) {\n      if (entry.newer) {\n        // advance the list\n        this.oldest = entry.newer;\n        this.oldest.older = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry.newer = entry.older = undefined;\n      this._container.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n    return undefined;\n  }\n\n  /** Access value for `key` without registering recent use. Useful if you do not\n   *  want to change the state of the cache, but only \"peek\" at it.\n   *  @returns The value associated with `key` if found, or undefined if not found.\n   */\n  public find(key: K): V | undefined {\n    const e = this._container.get(key);\n    return e ? e.value : undefined;\n  }\n\n  /** Check if there's a value for key in the cache without registering recent use. */\n  public has(key: K): boolean {\n    return this._container.has(key);\n  }\n\n  /**  Remove entry `key` from cache and return its value.\n   *  @returns The removed value, or undefined if not found.\n   */\n  public delete(key: K): V | undefined {\n    const entry = this._container.get(key);\n    if (!entry)\n      return;\n\n    this._container.delete(entry.key);\n    if (entry.newer && entry.older) {\n      // re-link the older entry with the newer entry\n      entry.older.newer = entry.newer;\n      entry.newer.older = entry.older;\n    } else if (entry.newer) {\n      // remove the link to us\n      entry.newer.older = undefined;\n      // link the newer entry to head\n      this.oldest = entry.newer;\n    } else if (entry.older) {\n      // remove the link to us\n      entry.older.newer = undefined;\n      // link the newer entry to head\n      this.newest = entry.older;\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  /**  Removes all entries */\n  public clear(): void {\n    // Note: clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._container.clear();\n  }\n\n  /** Returns an iterator over all keys, starting with the oldest. */\n  public keys(): Iterator<K | undefined> | undefined {\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all values, starting with the oldest. */\n  public values(): Iterator<V | undefined> | undefined {\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all entries, starting with the oldest. */\n  public entries(): Iterator<[K, V] | undefined> | undefined {\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\n  }\n\n  /**  Call `fun` for each entry, starting with the oldest entry. */\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\n    if (typeof thisObj !== \"object\") {\n      thisObj = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry.newer;\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  public toJSON(): Array<{ key: K, value: V }> {\n    const s = new Array(this.size);\n    let i = 0;\n    let entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry.newer;\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  public toString(): string {\n    let s = \"\";\n    let entry = this.oldest;\n    while (entry) {\n      s += `${String(entry.key)}:${entry.value}`;\n      entry = entry.newer;\n      if (entry) {\n        s += \" < \";\n      }\n    }\n    return s;\n  }\n}\n\n/** A [[LRUCache]] using a standard Map as its internal storage.\n * @public\n */\nexport class LRUMap<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUMap to hold up to `limit` entries.\n   */\n  constructor(limit: number) {\n    super(limit, new Map<K, Entry<K, V>>());\n  }\n}\n\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\n * @public\n */\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUDictionary to hold up to `limit` entries.\n   * @param limit The maximum number of entries permitted in the dictionary.\n   * @param compareKeys The function used to compare keys within the dictionary.\n   */\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\n  }\n}\n"]}
+{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,6CAA0C;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAa,KAAK;IAGG;IAAe;IAF3B,KAAK,CAAe;IACpB,KAAK,CAAe;IAC3B,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAJD,sBAIC;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IACP,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,QAAQ;IACX,UAAU,CAAuB;IAEzC,8BAA8B;IACvB,IAAI,CAAS;IAEpB,kDAAkD;IAC3C,KAAK,CAAS;IAErB,qEAAqE;IAC9D,MAAM,CAAe;IAE5B,oEAAoE;IAC7D,MAAM,CAAe;IAE5B;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;YAC5B,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;QACxC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAChB,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAC1B,CAAC;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO;QAET,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAClC,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,CAAC,CAAC,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxC,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO,GAAG,IAAI,CAAC,CAAC,uDAAuD;QACzE,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,IAAI,KAAK,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AA3PD,4BA2PC;AAED;;GAEG;AACH,MAAa,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAPD,wBAOC;AAED;;GAEG;AACH,MAAa,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,uBAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF;AATD,sCASC","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\nimport { OrderedComparator } from \"./Compare\";\nimport { Dictionary } from \"./Dictionary\";\n\n/**\n * Derived from:\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md at https://github.com/rsms/js-lru for details.\n */\n\n/** An entry holds the key and value, and pointers to any older and newer entries.\n * @public\n */\nexport class Entry<K, V> {\n  public newer?: Entry<K, V>;\n  public older?: Entry<K, V>;\n  constructor(public key: K, public value: V) { }\n}\n\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    const val: [K, V] = [ent.key, ent.value];\n    return { done: false, value: val };\n  }\n}\n\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.key };\n  }\n}\n\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.value };\n  }\n}\n\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\n * Compatible with a [[Dictionary]] or a standard Map.\n * @public\n */\nexport interface EntryContainer<K, V> {\n  readonly size: number;\n  clear(): void;\n  get(key: K): Entry<K, V> | undefined;\n  set(key: K, value: Entry<K, V>): void;\n  has(key: K): boolean;\n  delete(key: K): void;\n}\n\n/**\n * A mapping of a key/value pairs, where the size of the cache can be limited.\n *\n * When entries are inserted, if the cache is \"full\", the\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\n *\n * Illustration of the design:\n *\n * ```\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n * ```\n * @public\n */\nexport class LRUCache<K, V> {\n  private _container: EntryContainer<K, V>;\n\n  /** Current number of items */\n  public size: number;\n\n  /** Maximum number of items this cache can hold */\n  public limit: number;\n\n  /** Least recently-used entry. Invalidated when cache is modified. */\n  public oldest?: Entry<K, V>;\n\n  /** Most recently-used entry. Invalidated when cache is modified. */\n  public newest?: Entry<K, V>;\n\n  /**\n   * Construct a new LRUCache to hold up to `limit` entries.\n   */\n  public constructor(limit: number, container: EntryContainer<K, V>) {\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._container = container;\n  }\n\n  private markEntryAsUsed(entry: Entry<K, V>) {\n    if (entry === this.newest)\n      return; // Already the most recently used entry, so no need to update the list\n\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry.newer) {\n      if (entry === this.oldest) {\n        this.oldest = entry.newer;\n      }\n      entry.newer.older = entry.older; // C <-- E.\n    }\n    if (entry.older) {\n      entry.older.newer = entry.newer; // C. --> E\n    }\n    entry.newer = undefined; // D --x\n    entry.older = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest.newer = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\n  public assign(entries: Iterable<[K, V]>): void {\n    let entry;\n    let limit = this.limit || Number.MAX_VALUE;\n    this._container.clear();\n    const it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      const e = new Entry(itv.value[0], itv.value[1]);\n      this._container.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry.newer = e;\n        e.older = entry;\n      }\n      entry = e;\n      if (limit-- === 0) {\n        throw new Error(\"overflow\");\n      }\n    }\n    this.newest = entry;\n    this.size = this._container.size;\n  }\n\n  /** Get and register recent use of <key>.\n   *  Returns the value associated with <key> or undefined if not in cache.\n   */\n  public get(key: K): V | undefined {\n    // First, find our cache entry\n    const entry = this._container.get(key);\n    if (!entry)\n      return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this.markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\n   *  @returns `this`.\n   */\n  public set(key: K, value: V): LRUCache<K, V> {\n    let entry = this._container.get(key);\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this.markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._container.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest.newer = entry;\n      entry.older = this.newest;\n    } else {\n      // we're first in\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it is now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n    return this;\n  }\n\n  /**  Purge the least recently used (oldest) entry from the cache.\n   *  @returns The removed entry or undefined if the cache was empty.\n   */\n  public shift(): [K, V] | undefined {\n    const entry = this.oldest;\n    if (entry) {\n      if (entry.newer) {\n        // advance the list\n        this.oldest = entry.newer;\n        this.oldest.older = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry.newer = entry.older = undefined;\n      this._container.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n    return undefined;\n  }\n\n  /** Access value for `key` without registering recent use. Useful if you do not\n   *  want to change the state of the cache, but only \"peek\" at it.\n   *  @returns The value associated with `key` if found, or undefined if not found.\n   */\n  public find(key: K): V | undefined {\n    const e = this._container.get(key);\n    return e ? e.value : undefined;\n  }\n\n  /** Check if there's a value for key in the cache without registering recent use. */\n  public has(key: K): boolean {\n    return this._container.has(key);\n  }\n\n  /**  Remove entry `key` from cache and return its value.\n   *  @returns The removed value, or undefined if not found.\n   */\n  public delete(key: K): V | undefined {\n    const entry = this._container.get(key);\n    if (!entry)\n      return;\n\n    this._container.delete(entry.key);\n    if (entry.newer && entry.older) {\n      // re-link the older entry with the newer entry\n      entry.older.newer = entry.newer;\n      entry.newer.older = entry.older;\n    } else if (entry.newer) {\n      // remove the link to us\n      entry.newer.older = undefined;\n      // link the newer entry to head\n      this.oldest = entry.newer;\n    } else if (entry.older) {\n      // remove the link to us\n      entry.older.newer = undefined;\n      // link the newer entry to head\n      this.newest = entry.older;\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  /**  Removes all entries */\n  public clear(): void {\n    // Note: clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._container.clear();\n  }\n\n  /** Returns an iterator over all keys, starting with the oldest. */\n  public keys(): Iterator<K | undefined> | undefined {\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all values, starting with the oldest. */\n  public values(): Iterator<V | undefined> | undefined {\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all entries, starting with the oldest. */\n  public entries(): Iterator<[K, V] | undefined> | undefined {\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\n  }\n\n  /**  Call `fun` for each entry, starting with the oldest entry. */\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\n    if (typeof thisObj !== \"object\") {\n      thisObj = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry.newer;\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  public toJSON(): Array<{ key: K, value: V }> {\n    const s = new Array(this.size);\n    let i = 0;\n    let entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry.newer;\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  public toString(): string {\n    let s = \"\";\n    let entry = this.oldest;\n    while (entry) {\n      s += `${String(entry.key)}:${String(entry.value)}`;\n      entry = entry.newer;\n      if (entry) {\n        s += \" < \";\n      }\n    }\n    return s;\n  }\n}\n\n/** A [[LRUCache]] using a standard Map as its internal storage.\n * @public\n */\nexport class LRUMap<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUMap to hold up to `limit` entries.\n   */\n  constructor(limit: number) {\n    super(limit, new Map<K, Entry<K, V>>());\n  }\n}\n\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\n * @public\n */\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUDictionary to hold up to `limit` entries.\n   * @param limit The maximum number of entries permitted in the dictionary.\n   * @param compareKeys The function used to compare keys within the dictionary.\n   */\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\n  }\n}\n"]}

package/lib/cjs/ProcessDetector.d.ts

@@ -17,6 +17,8 @@ export declare class ProcessDetector {
     static get isElectronAppFrontend(): boolean;
     /** Is this process the backend of an Electron app? */
     static get isElectronAppBackend(): boolean;
+    /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */
+    static get isIEBrowser(): boolean;
     /** Is this process running in a browser on an iPad?
      * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.
      */

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

@@ -1 +1 @@
-{"version":3,"file":"ProcessDetector.d.ts","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,qBAAa,eAAe;IAE1B;;OAEG;IACH,WAAkB,gBAAgB,YAAiF;IAEnH;;MAEE;IACF,WAAkB,aAAa,YAA4E;IAE3G,uDAAuD;IACvD,WAAkB,qBAAqB,YAA0G;IAEjJ,sDAAsD;IACtD,WAAkB,oBAAoB,YAAyF;IAE/H;;OAEG;IACH,WAAkB,aAAa,YAE9B;IAED;;OAEG;IACH,WAAkB,eAAe,YAA2F;IAE5H;;MAEE;IACF,WAAkB,YAAY,YAAyD;IAEvF;;MAEE;IACF,WAAkB,gBAAgB,YAAmF;IAErH;;MAEE;IACF,WAAkB,eAAe,YAAyD;IAE1F,oGAAoG;IACpG,WAAkB,UAAU,YAE3B;IAED;;;OAGG;IACH,WAAkB,mBAAmB,YAAiE;IAEtG,iEAAiE;IACjE,WAAkB,gBAAgB,YAA2F;IAE7H,qEAAqE;IACrE,WAAkB,oBAAoB,YAA+F;IAErI,gEAAgE;IAChE,WAAkB,eAAe,YAAwE;IAEzG,oEAAoE;IACpE,WAAkB,mBAAmB,YAA4E;IAEjH,6CAA6C;IAC7C,WAAkB,kBAAkB,YAA+D;IAEnG,yEAAyE;IACzE,WAAkB,mBAAmB,YAAqE;CAC3G"}
+{"version":3,"file":"ProcessDetector.d.ts","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,qBAAa,eAAe;IAE1B;;OAEG;IACH,WAAkB,gBAAgB,YAAiF;IAEnH;;MAEE;IACF,WAAkB,aAAa,YAA4E;IAE3G,uDAAuD;IACvD,WAAkB,qBAAqB,YAA0G;IAEjJ,sDAAsD;IACtD,WAAkB,oBAAoB,YAAyF;IAE/H,qFAAqF;IACrF,WAAkB,WAAW,YAA+E;IAE5G;;OAEG;IACH,WAAkB,aAAa,YAE9B;IAED;;OAEG;IACH,WAAkB,eAAe,YAA2F;IAE5H;;MAEE;IACF,WAAkB,YAAY,YAAyD;IAEvF;;MAEE;IACF,WAAkB,gBAAgB,YAAmF;IAErH;;MAEE;IACF,WAAkB,eAAe,YAAyD;IAE1F,oGAAoG;IACpG,WAAkB,UAAU,YAE3B;IAED;;;OAGG;IACH,WAAkB,mBAAmB,YAAiE;IAEtG,iEAAiE;IACjE,WAAkB,gBAAgB,YAA2F;IAE7H,qEAAqE;IACrE,WAAkB,oBAAoB,YAA+F;IAErI,gEAAgE;IAChE,WAAkB,eAAe,YAAwE;IAEzG,oEAAoE;IACpE,WAAkB,mBAAmB,YAA4E;IAEjH,6CAA6C;IAC7C,WAAkB,kBAAkB,YAA+D;IAEnG,yEAAyE;IACzE,WAAkB,mBAAmB,YAAqE;CAC3G"}

package/lib/cjs/ProcessDetector.js

@@ -24,6 +24,8 @@ class ProcessDetector {
     static get isElectronAppFrontend() { return typeof navigator === "object" && navigator.userAgent.toLowerCase().indexOf("electron") >= 0; }
     /** Is this process the backend of an Electron app? */
     static get isElectronAppBackend() { return typeof process === "object" && process.versions.hasOwnProperty("electron"); }
+    /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */
+    static get isIEBrowser() { return !!document.documentMode || !!window.StyleMedia; }
     /** Is this process running in a browser on an iPad?
      * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.
      */

package/lib/cjs/ProcessDetector.js.map

@@ -1 +1 @@
-{"version":3,"file":"ProcessDetector.js","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,MAAa,eAAe;IAE1B;;OAEG;IACI,MAAM,KAAK,gBAAgB,KAAK,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC;IAEnH;;MAEE;IACK,MAAM,KAAK,aAAa,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,SAAS,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3G,uDAAuD;IAChD,MAAM,KAAK,qBAAqB,KAAK,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjJ,sDAAsD;IAC/C,MAAM,KAAK,oBAAoB,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAE/H;;OAEG;IACI,MAAM,KAAK,aAAa;QAC7B,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,UAAU,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,0DAA0D;IAClP,CAAC;IAED;;OAEG;IACI,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5H;;MAEE;IACK,MAAM,KAAK,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAEvF;;MAEE;IACK,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAErH;;MAEE;IACK,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAE1F,oGAAoG;IAC7F,MAAM,KAAK,UAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,qBAAqB,CAAC;IACvK,CAAC;IAED;;;OAGG;IACI,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEtG,iEAAiE;IAC1D,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7H,qEAAqE;IAC9D,MAAM,KAAK,oBAAoB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAErI,gEAAgE;IACzD,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,KAAK,CAAC,CAAC,CAAC;IAEzG,oEAAoE;IAC7D,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;IAEjH,6CAA6C;IACtC,MAAM,KAAK,kBAAkB,KAAK,OAAO,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAEnG,yEAAyE;IAClE,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;CAC3G;AAzED,0CAyEC","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 ProcessDetector\n */\n\n/** Functions to determine the type of JavaScript process currently executing.\n * @public\n */\nexport class ProcessDetector {\n\n  /** Is this a browser process?\n   * @note this method will also return `true` for the frontend of Electron or Mobile apps. They *are* browser processes.\n   */\n  public static get isBrowserProcess() { return typeof window === \"object\" && typeof window.navigator === \"object\"; }\n\n  /** Is this a Node process?\n   * @note this means \"is this a backend process\"? It will return `true` for all backend process, including Electron and mobile apps.\n  */\n  public static get isNodeProcess() { return typeof process === \"object\" && undefined !== process.platform; }\n\n  /** Is this process the frontend of an Electron app? */\n  public static get isElectronAppFrontend() { return typeof navigator === \"object\" && navigator.userAgent.toLowerCase().indexOf(\"electron\") >= 0; }\n\n  /** Is this process the backend of an Electron app? */\n  public static get isElectronAppBackend() { return typeof process === \"object\" && process.versions.hasOwnProperty(\"electron\"); }\n\n  /** Is this process running in a browser on an iPad?\n   * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPadBrowser() {\n    return this.isBrowserProcess && window.navigator.platform === \"iPad\" || (window.navigator.platform === \"MacIntel\" && window.navigator.maxTouchPoints > 0 && !(\"MSStream\" in window)); /* eslint-disable-line @typescript-eslint/no-deprecated */\n  }\n\n  /** Is this process running in a browser on an iPhone?\n   * @note This method will return `true` for any frontend running on an iPhone, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPhoneBrowser() { return this.isBrowserProcess && (/(iphone|ipod)/i.test(window.navigator.userAgent)); }\n\n  /** Is this process running in a browser on an iOS device?\n   * @note This method will return `true` for any frontend running on an iOS device, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n  */\n  public static get isIOSBrowser() { return this.isIPadBrowser || this.isIPhoneBrowser; }\n\n  /** Is this process running in a browser on an Android device?\n   * @note This method will return `true` for any frontend running on an Android device, whether it is a user-launched web browser (e.g. Chrome) or the frontend of a mobile app.\n  */\n  public static get isAndroidBrowser() { return this.isBrowserProcess && /android/i.test(window.navigator.userAgent); }\n\n  /** Is this process running in a browser on a mobile device?\n   * @note This method will return `true` for any frontend running on a mobile device, whether it is a user-launched web browser or the frontend of a mobile app.\n  */\n  public static get isMobileBrowser() { return this.isIOSBrowser || this.isAndroidBrowser; }\n\n  /** Is this process running in a Chromium based browser (Chrome / new Edge / Electron front end)? */\n  public static get isChromium() {\n    return (this.isBrowserProcess && window.navigator.userAgent.indexOf(\"Chrome\") > -1 && window.navigator.userAgent.indexOf(\"OP\") === -1) || this.isElectronAppFrontend;\n  }\n\n  /** Is this process the frontend of an iTwin mobile application?\n   * @note this indicates that this is a browser process started by an iTwin mobile application.\n   * It will return `false` when running user-launched web browsers on a mobile device.\n   */\n  public static get isMobileAppFrontend() { return this.isAndroidAppFrontend || this.isIOSAppFrontend; }\n\n  /** Is this process the frontend of an iOS mobile application? */\n  public static get isIOSAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=ios\") !== -1; }\n\n  /** Is this process the frontend of an Android mobile application? */\n  public static get isAndroidAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=android\") !== -1; }\n\n  /** Is this process the backend of an iOS mobile application? */\n  public static get isIOSAppBackend() { return this.isNodeProcess && (process.platform as any) === \"ios\"; }\n\n  /** Is this process the backend of an Android mobile application? */\n  public static get isAndroidAppBackend() { return this.isNodeProcess && (process.platform as any) === \"android\"; }\n\n  /**  Is this process a mobile app backend? */\n  public static get isMobileAppBackend() { return this.isIOSAppBackend || this.isAndroidAppBackend; }\n\n  /** Is this process the frontend of a native (Electron or Mobile) app? */\n  public static get isNativeAppFrontend() { return this.isElectronAppFrontend || this.isMobileAppFrontend; }\n}\n"]}
+{"version":3,"file":"ProcessDetector.js","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,MAAa,eAAe;IAE1B;;OAEG;IACI,MAAM,KAAK,gBAAgB,KAAK,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC;IAEnH;;MAEE;IACK,MAAM,KAAK,aAAa,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,SAAS,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3G,uDAAuD;IAChD,MAAM,KAAK,qBAAqB,KAAK,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjJ,sDAAsD;IAC/C,MAAM,KAAK,oBAAoB,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAE/H,qFAAqF;IAC9E,MAAM,KAAK,WAAW,KAAK,OAAO,CAAC,CAAE,QAAgB,CAAC,YAAY,IAAI,CAAC,CAAE,MAAc,CAAC,UAAU,CAAC,CAAC,CAAC;IAE5G;;OAEG;IACI,MAAM,KAAK,aAAa;QAC7B,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,UAAU,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,0DAA0D;IAClP,CAAC;IAED;;OAEG;IACI,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5H;;MAEE;IACK,MAAM,KAAK,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAEvF;;MAEE;IACK,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAErH;;MAEE;IACK,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAE1F,oGAAoG;IAC7F,MAAM,KAAK,UAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,qBAAqB,CAAC;IACvK,CAAC;IAED;;;OAGG;IACI,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEtG,iEAAiE;IAC1D,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7H,qEAAqE;IAC9D,MAAM,KAAK,oBAAoB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAErI,gEAAgE;IACzD,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,KAAK,CAAC,CAAC,CAAC;IAEzG,oEAAoE;IAC7D,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;IAEjH,6CAA6C;IACtC,MAAM,KAAK,kBAAkB,KAAK,OAAO,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAEnG,yEAAyE;IAClE,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;CAC3G;AA5ED,0CA4EC","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 ProcessDetector\n */\n\n/** Functions to determine the type of JavaScript process currently executing.\n * @public\n */\nexport class ProcessDetector {\n\n  /** Is this a browser process?\n   * @note this method will also return `true` for the frontend of Electron or Mobile apps. They *are* browser processes.\n   */\n  public static get isBrowserProcess() { return typeof window === \"object\" && typeof window.navigator === \"object\"; }\n\n  /** Is this a Node process?\n   * @note this means \"is this a backend process\"? It will return `true` for all backend process, including Electron and mobile apps.\n  */\n  public static get isNodeProcess() { return typeof process === \"object\" && undefined !== process.platform; }\n\n  /** Is this process the frontend of an Electron app? */\n  public static get isElectronAppFrontend() { return typeof navigator === \"object\" && navigator.userAgent.toLowerCase().indexOf(\"electron\") >= 0; }\n\n  /** Is this process the backend of an Electron app? */\n  public static get isElectronAppBackend() { return typeof process === \"object\" && process.versions.hasOwnProperty(\"electron\"); }\n\n  /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */\n  public static get isIEBrowser() { return !!(document as any).documentMode || !!(window as any).StyleMedia; }\n\n  /** Is this process running in a browser on an iPad?\n   * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPadBrowser() {\n    return this.isBrowserProcess && window.navigator.platform === \"iPad\" || (window.navigator.platform === \"MacIntel\" && window.navigator.maxTouchPoints > 0 && !(\"MSStream\" in window)); /* eslint-disable-line @typescript-eslint/no-deprecated */\n  }\n\n  /** Is this process running in a browser on an iPhone?\n   * @note This method will return `true` for any frontend running on an iPhone, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPhoneBrowser() { return this.isBrowserProcess && (/(iphone|ipod)/i.test(window.navigator.userAgent)); }\n\n  /** Is this process running in a browser on an iOS device?\n   * @note This method will return `true` for any frontend running on an iOS device, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n  */\n  public static get isIOSBrowser() { return this.isIPadBrowser || this.isIPhoneBrowser; }\n\n  /** Is this process running in a browser on an Android device?\n   * @note This method will return `true` for any frontend running on an Android device, whether it is a user-launched web browser (e.g. Chrome) or the frontend of a mobile app.\n  */\n  public static get isAndroidBrowser() { return this.isBrowserProcess && /android/i.test(window.navigator.userAgent); }\n\n  /** Is this process running in a browser on a mobile device?\n   * @note This method will return `true` for any frontend running on a mobile device, whether it is a user-launched web browser or the frontend of a mobile app.\n  */\n  public static get isMobileBrowser() { return this.isIOSBrowser || this.isAndroidBrowser; }\n\n  /** Is this process running in a Chromium based browser (Chrome / new Edge / Electron front end)? */\n  public static get isChromium() {\n    return (this.isBrowserProcess && window.navigator.userAgent.indexOf(\"Chrome\") > -1 && window.navigator.userAgent.indexOf(\"OP\") === -1) || this.isElectronAppFrontend;\n  }\n\n  /** Is this process the frontend of an iTwin mobile application?\n   * @note this indicates that this is a browser process started by an iTwin mobile application.\n   * It will return `false` when running user-launched web browsers on a mobile device.\n   */\n  public static get isMobileAppFrontend() { return this.isAndroidAppFrontend || this.isIOSAppFrontend; }\n\n  /** Is this process the frontend of an iOS mobile application? */\n  public static get isIOSAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=ios\") !== -1; }\n\n  /** Is this process the frontend of an Android mobile application? */\n  public static get isAndroidAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=android\") !== -1; }\n\n  /** Is this process the backend of an iOS mobile application? */\n  public static get isIOSAppBackend() { return this.isNodeProcess && (process.platform as any) === \"ios\"; }\n\n  /** Is this process the backend of an Android mobile application? */\n  public static get isAndroidAppBackend() { return this.isNodeProcess && (process.platform as any) === \"android\"; }\n\n  /**  Is this process a mobile app backend? */\n  public static get isMobileAppBackend() { return this.isIOSAppBackend || this.isAndroidAppBackend; }\n\n  /** Is this process the frontend of a native (Electron or Mobile) app? */\n  public static get isNativeAppFrontend() { return this.isElectronAppFrontend || this.isMobileAppFrontend; }\n}\n"]}

package/lib/cjs/core-bentley.d.ts

@@ -11,6 +11,7 @@ export * from "./Compare";
 export * from "./CompressedId64Set";
 export * from "./Dictionary";
 export * from "./Disposable";
+export * from "./Expect";
 export * from "./Id";
 export * from "./IndexMap";
 export * from "./JsonSchema";

package/lib/cjs/core-bentley.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"core-bentley.d.ts","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAIA,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;AAG/B,cAAc,0BAA0B,CAAC;AAEzC;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG"}
+{"version":3,"file":"core-bentley.d.ts","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAIA,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,UAAU,CAAC;AACzB,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;AAG/B,cAAc,0BAA0B,CAAC;AAEzC;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG"}

package/lib/cjs/core-bentley.js

@@ -31,6 +31,7 @@ __exportStar(require("./Compare"), exports);
 __exportStar(require("./CompressedId64Set"), exports);
 __exportStar(require("./Dictionary"), exports);
 __exportStar(require("./Disposable"), exports);
+__exportStar(require("./Expect"), exports);
 __exportStar(require("./Id"), exports);
 __exportStar(require("./IndexMap"), exports);
 __exportStar(require("./JsonSchema"), exports);

package/lib/cjs/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,gDAA8B;AAC9B,2CAAyB;AACzB,4CAA0B;AAC1B,iDAA+B;AAC/B,0DAAwC;AACxC,mDAAiC;AACjC,6CAA2B;AAC3B,+CAA6B;AAC7B,+CAA6B;AAC7B,4CAA0B;AAC1B,sDAAoC;AACpC,+CAA6B;AAC7B,+CAA6B;AAC7B,uCAAqB;AACrB,6CAA2B;AAC3B,+CAA6B;AAC7B,8CAA4B;AAC5B,2CAAyB;AACzB,2CAAyB;AACzB,kDAAgC;AAChC,qDAAmC;AACnC,wDAAsC;AACtC,+CAA6B;AAC7B,mDAAiC;AACjC,kDAAgC;AAChC,oDAAkC;AAClC,gDAA8B;AAC9B,gDAA8B;AAC9B,yCAAuB;AACvB,4CAA0B;AAC1B,kDAAgC;AAChC,sDAAoC;AACpC,qDAAmC;AACnC,iDAA+B;AAC/B,iDAA+B;AAE/B,oFAAoF;AACpF,2DAAyC;AAEzC;;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// Temporarily (until 5.0) export top-level internal APIs to avoid breaking callers.\nexport * from \"./internal/cross-package\";\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"]}
+{"version":3,"file":"core-bentley.js","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;+FAG+F;AAC/F,gDAA8B;AAC9B,2CAAyB;AACzB,4CAA0B;AAC1B,iDAA+B;AAC/B,0DAAwC;AACxC,mDAAiC;AACjC,6CAA2B;AAC3B,+CAA6B;AAC7B,+CAA6B;AAC7B,4CAA0B;AAC1B,sDAAoC;AACpC,+CAA6B;AAC7B,+CAA6B;AAC7B,2CAAyB;AACzB,uCAAqB;AACrB,6CAA2B;AAC3B,+CAA6B;AAC7B,8CAA4B;AAC5B,2CAAyB;AACzB,2CAAyB;AACzB,kDAAgC;AAChC,qDAAmC;AACnC,wDAAsC;AACtC,+CAA6B;AAC7B,mDAAiC;AACjC,kDAAgC;AAChC,oDAAkC;AAClC,gDAA8B;AAC9B,gDAA8B;AAC9B,yCAAuB;AACvB,4CAA0B;AAC1B,kDAAgC;AAChC,sDAAoC;AACpC,qDAAmC;AACnC,iDAA+B;AAC/B,iDAA+B;AAE/B,oFAAoF;AACpF,2DAAyC;AAEzC;;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 \"./Expect\";\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// Temporarily (until 5.0) export top-level internal APIs to avoid breaking callers.\nexport * from \"./internal/cross-package\";\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/Expect.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Expects that a value is defined (not undefined).
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle undefined values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is defined.
+ * @throws Error if the value is undefined.
+ * @internal
+ */
+export declare function expectDefined<T>(value: T | undefined, message?: string): T;
+/**
+ * Expects that a value is not null.
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle null values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is not null.
+ * @throws Error if the value is null.
+ * @internal
+ */
+export declare function expectNotNull<T>(value: T | null, message?: string): T;
+//# sourceMappingURL=Expect.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Expect.d.ts","sourceRoot":"","sources":["../../src/Expect.ts"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,CAAC,CAK1E;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,CAAC,CAKrE"}

package/lib/esm/Expect.js

@@ -0,0 +1,37 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/**
+ * Expects that a value is defined (not undefined).
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle undefined values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is defined.
+ * @throws Error if the value is undefined.
+ * @internal
+ */
+export function expectDefined(value, message) {
+    if (value === undefined) {
+        throw new Error(message ?? "Expected value to be defined, but it was undefined.");
+    }
+    return value;
+}
+/**
+ * Expects that a value is not null.
+ * @note Almost always, places that use this function should in the future be cleaned up to properly
+ * handle null values instead of throwing an error.
+ * @param value The value to check.
+ * @param message Optional error message to be used in thrown Error.
+ * @returns The original value if it is not null.
+ * @throws Error if the value is null.
+ * @internal
+ */
+export function expectNotNull(value, message) {
+    if (value === null) {
+        throw new Error(message ?? "Expected value to be not null, but it was null.");
+    }
+    return value;
+}
+//# sourceMappingURL=Expect.js.map

package/lib/esm/Expect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Expect.js","sourceRoot":"","sources":["../../src/Expect.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAI,KAAoB,EAAE,OAAgB;IACrE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,qDAAqD,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAI,KAAe,EAAE,OAAgB;IAChE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,iDAAiD,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,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\n/**\n * Expects that a value is defined (not undefined).\n * @note Almost always, places that use this function should in the future be cleaned up to properly\n * handle undefined values instead of throwing an error.\n * @param value The value to check.\n * @param message Optional error message to be used in thrown Error.\n * @returns The original value if it is defined.\n * @throws Error if the value is undefined.\n * @internal\n */\nexport function expectDefined<T>(value: T | undefined, message?: string): T {\n  if (value === undefined) {\n    throw new Error(message ?? \"Expected value to be defined, but it was undefined.\");\n  }\n  return value;\n}\n\n/**\n * Expects that a value is not null.\n * @note Almost always, places that use this function should in the future be cleaned up to properly\n * handle null values instead of throwing an error.\n * @param value The value to check.\n * @param message Optional error message to be used in thrown Error.\n * @returns The original value if it is not null.\n * @throws Error if the value is null.\n * @internal\n */\nexport function expectNotNull<T>(value: T | null, message?: string): T {\n  if (value === null) {\n    throw new Error(message ?? \"Expected value to be not null, but it was null.\");\n  }\n  return value;\n}\n"]}

package/lib/esm/LRUMap.js

@@ -307,7 +307,7 @@ export class LRUCache {
         let s = "";
         let entry = this.oldest;
         while (entry) {
-            s += `${String(entry.key)}:${entry.value}`;
+            s += `${String(entry.key)}:${String(entry.value)}`;
             entry = entry.newer;
             if (entry) {
                 s += " < ";

package/lib/esm/LRUMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAM,OAAO,KAAK;IAGG;IAAe;IAF3B,KAAK,CAAe;IACpB,KAAK,CAAe;IAC3B,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IACP,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,QAAQ;IACX,UAAU,CAAuB;IAEzC,8BAA8B;IACvB,IAAI,CAAS;IAEpB,kDAAkD;IAC3C,KAAK,CAAS;IAErB,qEAAqE;IAC9D,MAAM,CAAe;IAE5B,oEAAoE;IAC7D,MAAM,CAAe;IAE5B;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;YAC5B,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;QACxC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAChB,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAC1B,CAAC;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO;QAET,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAClC,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,CAAC,CAAC,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxC,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO,GAAG,IAAI,CAAC,CAAC,uDAAuD;QACzE,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,IAAI,KAAK,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,UAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF","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\nimport { OrderedComparator } from \"./Compare\";\nimport { Dictionary } from \"./Dictionary\";\n\n/**\n * Derived from:\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md at https://github.com/rsms/js-lru for details.\n */\n\n/** An entry holds the key and value, and pointers to any older and newer entries.\n * @public\n */\nexport class Entry<K, V> {\n  public newer?: Entry<K, V>;\n  public older?: Entry<K, V>;\n  constructor(public key: K, public value: V) { }\n}\n\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    const val: [K, V] = [ent.key, ent.value];\n    return { done: false, value: val };\n  }\n}\n\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.key };\n  }\n}\n\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.value };\n  }\n}\n\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\n * Compatible with a [[Dictionary]] or a standard Map.\n * @public\n */\nexport interface EntryContainer<K, V> {\n  readonly size: number;\n  clear(): void;\n  get(key: K): Entry<K, V> | undefined;\n  set(key: K, value: Entry<K, V>): void;\n  has(key: K): boolean;\n  delete(key: K): void;\n}\n\n/**\n * A mapping of a key/value pairs, where the size of the cache can be limited.\n *\n * When entries are inserted, if the cache is \"full\", the\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\n *\n * Illustration of the design:\n *\n * ```\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n * ```\n * @public\n */\nexport class LRUCache<K, V> {\n  private _container: EntryContainer<K, V>;\n\n  /** Current number of items */\n  public size: number;\n\n  /** Maximum number of items this cache can hold */\n  public limit: number;\n\n  /** Least recently-used entry. Invalidated when cache is modified. */\n  public oldest?: Entry<K, V>;\n\n  /** Most recently-used entry. Invalidated when cache is modified. */\n  public newest?: Entry<K, V>;\n\n  /**\n   * Construct a new LRUCache to hold up to `limit` entries.\n   */\n  public constructor(limit: number, container: EntryContainer<K, V>) {\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._container = container;\n  }\n\n  private markEntryAsUsed(entry: Entry<K, V>) {\n    if (entry === this.newest)\n      return; // Already the most recently used entry, so no need to update the list\n\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry.newer) {\n      if (entry === this.oldest) {\n        this.oldest = entry.newer;\n      }\n      entry.newer.older = entry.older; // C <-- E.\n    }\n    if (entry.older) {\n      entry.older.newer = entry.newer; // C. --> E\n    }\n    entry.newer = undefined; // D --x\n    entry.older = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest.newer = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\n  public assign(entries: Iterable<[K, V]>): void {\n    let entry;\n    let limit = this.limit || Number.MAX_VALUE;\n    this._container.clear();\n    const it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      const e = new Entry(itv.value[0], itv.value[1]);\n      this._container.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry.newer = e;\n        e.older = entry;\n      }\n      entry = e;\n      if (limit-- === 0) {\n        throw new Error(\"overflow\");\n      }\n    }\n    this.newest = entry;\n    this.size = this._container.size;\n  }\n\n  /** Get and register recent use of <key>.\n   *  Returns the value associated with <key> or undefined if not in cache.\n   */\n  public get(key: K): V | undefined {\n    // First, find our cache entry\n    const entry = this._container.get(key);\n    if (!entry)\n      return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this.markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\n   *  @returns `this`.\n   */\n  public set(key: K, value: V): LRUCache<K, V> {\n    let entry = this._container.get(key);\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this.markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._container.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest.newer = entry;\n      entry.older = this.newest;\n    } else {\n      // we're first in\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it is now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n    return this;\n  }\n\n  /**  Purge the least recently used (oldest) entry from the cache.\n   *  @returns The removed entry or undefined if the cache was empty.\n   */\n  public shift(): [K, V] | undefined {\n    const entry = this.oldest;\n    if (entry) {\n      if (entry.newer) {\n        // advance the list\n        this.oldest = entry.newer;\n        this.oldest.older = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry.newer = entry.older = undefined;\n      this._container.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n    return undefined;\n  }\n\n  /** Access value for `key` without registering recent use. Useful if you do not\n   *  want to change the state of the cache, but only \"peek\" at it.\n   *  @returns The value associated with `key` if found, or undefined if not found.\n   */\n  public find(key: K): V | undefined {\n    const e = this._container.get(key);\n    return e ? e.value : undefined;\n  }\n\n  /** Check if there's a value for key in the cache without registering recent use. */\n  public has(key: K): boolean {\n    return this._container.has(key);\n  }\n\n  /**  Remove entry `key` from cache and return its value.\n   *  @returns The removed value, or undefined if not found.\n   */\n  public delete(key: K): V | undefined {\n    const entry = this._container.get(key);\n    if (!entry)\n      return;\n\n    this._container.delete(entry.key);\n    if (entry.newer && entry.older) {\n      // re-link the older entry with the newer entry\n      entry.older.newer = entry.newer;\n      entry.newer.older = entry.older;\n    } else if (entry.newer) {\n      // remove the link to us\n      entry.newer.older = undefined;\n      // link the newer entry to head\n      this.oldest = entry.newer;\n    } else if (entry.older) {\n      // remove the link to us\n      entry.older.newer = undefined;\n      // link the newer entry to head\n      this.newest = entry.older;\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  /**  Removes all entries */\n  public clear(): void {\n    // Note: clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._container.clear();\n  }\n\n  /** Returns an iterator over all keys, starting with the oldest. */\n  public keys(): Iterator<K | undefined> | undefined {\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all values, starting with the oldest. */\n  public values(): Iterator<V | undefined> | undefined {\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all entries, starting with the oldest. */\n  public entries(): Iterator<[K, V] | undefined> | undefined {\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\n  }\n\n  /**  Call `fun` for each entry, starting with the oldest entry. */\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\n    if (typeof thisObj !== \"object\") {\n      thisObj = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry.newer;\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  public toJSON(): Array<{ key: K, value: V }> {\n    const s = new Array(this.size);\n    let i = 0;\n    let entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry.newer;\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  public toString(): string {\n    let s = \"\";\n    let entry = this.oldest;\n    while (entry) {\n      s += `${String(entry.key)}:${entry.value}`;\n      entry = entry.newer;\n      if (entry) {\n        s += \" < \";\n      }\n    }\n    return s;\n  }\n}\n\n/** A [[LRUCache]] using a standard Map as its internal storage.\n * @public\n */\nexport class LRUMap<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUMap to hold up to `limit` entries.\n   */\n  constructor(limit: number) {\n    super(limit, new Map<K, Entry<K, V>>());\n  }\n}\n\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\n * @public\n */\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUDictionary to hold up to `limit` entries.\n   * @param limit The maximum number of entries permitted in the dictionary.\n   * @param compareKeys The function used to compare keys within the dictionary.\n   */\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\n  }\n}\n"]}
+{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAM,OAAO,KAAK;IAGG;IAAe;IAF3B,KAAK,CAAe;IACpB,KAAK,CAAe;IAC3B,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IACP,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IACT,MAAM,CAA0B;IACxC,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,QAAQ;IACX,UAAU,CAAuB;IAEzC,8BAA8B;IACvB,IAAI,CAAS;IAEpB,kDAAkD;IAC3C,KAAK,CAAS;IAErB,qEAAqE;IAC9D,MAAM,CAAe;IAE5B,oEAAoE;IAC7D,MAAM,CAAe;IAE5B;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;YAC5B,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;QAC9C,CAAC;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;QACxC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAChB,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAC1B,CAAC;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO;QAET,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAClC,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5B,CAAC;aAAM,CAAC,CAAC,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxC,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO,GAAG,IAAI,CAAC,CAAC,uDAAuD;QACzE,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE,CAAC;YACb,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,IAAI,KAAK,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,UAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF","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\nimport { OrderedComparator } from \"./Compare\";\nimport { Dictionary } from \"./Dictionary\";\n\n/**\n * Derived from:\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md at https://github.com/rsms/js-lru for details.\n */\n\n/** An entry holds the key and value, and pointers to any older and newer entries.\n * @public\n */\nexport class Entry<K, V> {\n  public newer?: Entry<K, V>;\n  public older?: Entry<K, V>;\n  constructor(public key: K, public value: V) { }\n}\n\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    const val: [K, V] = [ent.key, ent.value];\n    return { done: false, value: val };\n  }\n}\n\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.key };\n  }\n}\n\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.value };\n  }\n}\n\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\n * Compatible with a [[Dictionary]] or a standard Map.\n * @public\n */\nexport interface EntryContainer<K, V> {\n  readonly size: number;\n  clear(): void;\n  get(key: K): Entry<K, V> | undefined;\n  set(key: K, value: Entry<K, V>): void;\n  has(key: K): boolean;\n  delete(key: K): void;\n}\n\n/**\n * A mapping of a key/value pairs, where the size of the cache can be limited.\n *\n * When entries are inserted, if the cache is \"full\", the\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\n *\n * Illustration of the design:\n *\n * ```\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n * ```\n * @public\n */\nexport class LRUCache<K, V> {\n  private _container: EntryContainer<K, V>;\n\n  /** Current number of items */\n  public size: number;\n\n  /** Maximum number of items this cache can hold */\n  public limit: number;\n\n  /** Least recently-used entry. Invalidated when cache is modified. */\n  public oldest?: Entry<K, V>;\n\n  /** Most recently-used entry. Invalidated when cache is modified. */\n  public newest?: Entry<K, V>;\n\n  /**\n   * Construct a new LRUCache to hold up to `limit` entries.\n   */\n  public constructor(limit: number, container: EntryContainer<K, V>) {\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._container = container;\n  }\n\n  private markEntryAsUsed(entry: Entry<K, V>) {\n    if (entry === this.newest)\n      return; // Already the most recently used entry, so no need to update the list\n\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry.newer) {\n      if (entry === this.oldest) {\n        this.oldest = entry.newer;\n      }\n      entry.newer.older = entry.older; // C <-- E.\n    }\n    if (entry.older) {\n      entry.older.newer = entry.newer; // C. --> E\n    }\n    entry.newer = undefined; // D --x\n    entry.older = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest.newer = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\n  public assign(entries: Iterable<[K, V]>): void {\n    let entry;\n    let limit = this.limit || Number.MAX_VALUE;\n    this._container.clear();\n    const it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      const e = new Entry(itv.value[0], itv.value[1]);\n      this._container.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry.newer = e;\n        e.older = entry;\n      }\n      entry = e;\n      if (limit-- === 0) {\n        throw new Error(\"overflow\");\n      }\n    }\n    this.newest = entry;\n    this.size = this._container.size;\n  }\n\n  /** Get and register recent use of <key>.\n   *  Returns the value associated with <key> or undefined if not in cache.\n   */\n  public get(key: K): V | undefined {\n    // First, find our cache entry\n    const entry = this._container.get(key);\n    if (!entry)\n      return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this.markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\n   *  @returns `this`.\n   */\n  public set(key: K, value: V): LRUCache<K, V> {\n    let entry = this._container.get(key);\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this.markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._container.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest.newer = entry;\n      entry.older = this.newest;\n    } else {\n      // we're first in\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it is now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n    return this;\n  }\n\n  /**  Purge the least recently used (oldest) entry from the cache.\n   *  @returns The removed entry or undefined if the cache was empty.\n   */\n  public shift(): [K, V] | undefined {\n    const entry = this.oldest;\n    if (entry) {\n      if (entry.newer) {\n        // advance the list\n        this.oldest = entry.newer;\n        this.oldest.older = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry.newer = entry.older = undefined;\n      this._container.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n    return undefined;\n  }\n\n  /** Access value for `key` without registering recent use. Useful if you do not\n   *  want to change the state of the cache, but only \"peek\" at it.\n   *  @returns The value associated with `key` if found, or undefined if not found.\n   */\n  public find(key: K): V | undefined {\n    const e = this._container.get(key);\n    return e ? e.value : undefined;\n  }\n\n  /** Check if there's a value for key in the cache without registering recent use. */\n  public has(key: K): boolean {\n    return this._container.has(key);\n  }\n\n  /**  Remove entry `key` from cache and return its value.\n   *  @returns The removed value, or undefined if not found.\n   */\n  public delete(key: K): V | undefined {\n    const entry = this._container.get(key);\n    if (!entry)\n      return;\n\n    this._container.delete(entry.key);\n    if (entry.newer && entry.older) {\n      // re-link the older entry with the newer entry\n      entry.older.newer = entry.newer;\n      entry.newer.older = entry.older;\n    } else if (entry.newer) {\n      // remove the link to us\n      entry.newer.older = undefined;\n      // link the newer entry to head\n      this.oldest = entry.newer;\n    } else if (entry.older) {\n      // remove the link to us\n      entry.older.newer = undefined;\n      // link the newer entry to head\n      this.newest = entry.older;\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  /**  Removes all entries */\n  public clear(): void {\n    // Note: clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._container.clear();\n  }\n\n  /** Returns an iterator over all keys, starting with the oldest. */\n  public keys(): Iterator<K | undefined> | undefined {\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all values, starting with the oldest. */\n  public values(): Iterator<V | undefined> | undefined {\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all entries, starting with the oldest. */\n  public entries(): Iterator<[K, V] | undefined> | undefined {\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\n  }\n\n  /**  Call `fun` for each entry, starting with the oldest entry. */\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\n    if (typeof thisObj !== \"object\") {\n      thisObj = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry.newer;\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  public toJSON(): Array<{ key: K, value: V }> {\n    const s = new Array(this.size);\n    let i = 0;\n    let entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry.newer;\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  public toString(): string {\n    let s = \"\";\n    let entry = this.oldest;\n    while (entry) {\n      s += `${String(entry.key)}:${String(entry.value)}`;\n      entry = entry.newer;\n      if (entry) {\n        s += \" < \";\n      }\n    }\n    return s;\n  }\n}\n\n/** A [[LRUCache]] using a standard Map as its internal storage.\n * @public\n */\nexport class LRUMap<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUMap to hold up to `limit` entries.\n   */\n  constructor(limit: number) {\n    super(limit, new Map<K, Entry<K, V>>());\n  }\n}\n\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\n * @public\n */\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUDictionary to hold up to `limit` entries.\n   * @param limit The maximum number of entries permitted in the dictionary.\n   * @param compareKeys The function used to compare keys within the dictionary.\n   */\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\n  }\n}\n"]}

package/lib/esm/ProcessDetector.d.ts

@@ -17,6 +17,8 @@ export declare class ProcessDetector {
     static get isElectronAppFrontend(): boolean;
     /** Is this process the backend of an Electron app? */
     static get isElectronAppBackend(): boolean;
+    /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */
+    static get isIEBrowser(): boolean;
     /** Is this process running in a browser on an iPad?
      * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.
      */

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

@@ -1 +1 @@
-{"version":3,"file":"ProcessDetector.d.ts","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,qBAAa,eAAe;IAE1B;;OAEG;IACH,WAAkB,gBAAgB,YAAiF;IAEnH;;MAEE;IACF,WAAkB,aAAa,YAA4E;IAE3G,uDAAuD;IACvD,WAAkB,qBAAqB,YAA0G;IAEjJ,sDAAsD;IACtD,WAAkB,oBAAoB,YAAyF;IAE/H;;OAEG;IACH,WAAkB,aAAa,YAE9B;IAED;;OAEG;IACH,WAAkB,eAAe,YAA2F;IAE5H;;MAEE;IACF,WAAkB,YAAY,YAAyD;IAEvF;;MAEE;IACF,WAAkB,gBAAgB,YAAmF;IAErH;;MAEE;IACF,WAAkB,eAAe,YAAyD;IAE1F,oGAAoG;IACpG,WAAkB,UAAU,YAE3B;IAED;;;OAGG;IACH,WAAkB,mBAAmB,YAAiE;IAEtG,iEAAiE;IACjE,WAAkB,gBAAgB,YAA2F;IAE7H,qEAAqE;IACrE,WAAkB,oBAAoB,YAA+F;IAErI,gEAAgE;IAChE,WAAkB,eAAe,YAAwE;IAEzG,oEAAoE;IACpE,WAAkB,mBAAmB,YAA4E;IAEjH,6CAA6C;IAC7C,WAAkB,kBAAkB,YAA+D;IAEnG,yEAAyE;IACzE,WAAkB,mBAAmB,YAAqE;CAC3G"}
+{"version":3,"file":"ProcessDetector.d.ts","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,qBAAa,eAAe;IAE1B;;OAEG;IACH,WAAkB,gBAAgB,YAAiF;IAEnH;;MAEE;IACF,WAAkB,aAAa,YAA4E;IAE3G,uDAAuD;IACvD,WAAkB,qBAAqB,YAA0G;IAEjJ,sDAAsD;IACtD,WAAkB,oBAAoB,YAAyF;IAE/H,qFAAqF;IACrF,WAAkB,WAAW,YAA+E;IAE5G;;OAEG;IACH,WAAkB,aAAa,YAE9B;IAED;;OAEG;IACH,WAAkB,eAAe,YAA2F;IAE5H;;MAEE;IACF,WAAkB,YAAY,YAAyD;IAEvF;;MAEE;IACF,WAAkB,gBAAgB,YAAmF;IAErH;;MAEE;IACF,WAAkB,eAAe,YAAyD;IAE1F,oGAAoG;IACpG,WAAkB,UAAU,YAE3B;IAED;;;OAGG;IACH,WAAkB,mBAAmB,YAAiE;IAEtG,iEAAiE;IACjE,WAAkB,gBAAgB,YAA2F;IAE7H,qEAAqE;IACrE,WAAkB,oBAAoB,YAA+F;IAErI,gEAAgE;IAChE,WAAkB,eAAe,YAAwE;IAEzG,oEAAoE;IACpE,WAAkB,mBAAmB,YAA4E;IAEjH,6CAA6C;IAC7C,WAAkB,kBAAkB,YAA+D;IAEnG,yEAAyE;IACzE,WAAkB,mBAAmB,YAAqE;CAC3G"}

package/lib/esm/ProcessDetector.js

@@ -21,6 +21,8 @@ export class ProcessDetector {
     static get isElectronAppFrontend() { return typeof navigator === "object" && navigator.userAgent.toLowerCase().indexOf("electron") >= 0; }
     /** Is this process the backend of an Electron app? */
     static get isElectronAppBackend() { return typeof process === "object" && process.versions.hasOwnProperty("electron"); }
+    /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */
+    static get isIEBrowser() { return !!document.documentMode || !!window.StyleMedia; }
     /** Is this process running in a browser on an iPad?
      * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.
      */

package/lib/esm/ProcessDetector.js.map

@@ -1 +1 @@
-{"version":3,"file":"ProcessDetector.js","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,OAAO,eAAe;IAE1B;;OAEG;IACI,MAAM,KAAK,gBAAgB,KAAK,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC;IAEnH;;MAEE;IACK,MAAM,KAAK,aAAa,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,SAAS,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3G,uDAAuD;IAChD,MAAM,KAAK,qBAAqB,KAAK,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjJ,sDAAsD;IAC/C,MAAM,KAAK,oBAAoB,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAE/H;;OAEG;IACI,MAAM,KAAK,aAAa;QAC7B,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,UAAU,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,0DAA0D;IAClP,CAAC;IAED;;OAEG;IACI,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5H;;MAEE;IACK,MAAM,KAAK,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAEvF;;MAEE;IACK,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAErH;;MAEE;IACK,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAE1F,oGAAoG;IAC7F,MAAM,KAAK,UAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,qBAAqB,CAAC;IACvK,CAAC;IAED;;;OAGG;IACI,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEtG,iEAAiE;IAC1D,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7H,qEAAqE;IAC9D,MAAM,KAAK,oBAAoB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAErI,gEAAgE;IACzD,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,KAAK,CAAC,CAAC,CAAC;IAEzG,oEAAoE;IAC7D,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;IAEjH,6CAA6C;IACtC,MAAM,KAAK,kBAAkB,KAAK,OAAO,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAEnG,yEAAyE;IAClE,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;CAC3G","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 ProcessDetector\n */\n\n/** Functions to determine the type of JavaScript process currently executing.\n * @public\n */\nexport class ProcessDetector {\n\n  /** Is this a browser process?\n   * @note this method will also return `true` for the frontend of Electron or Mobile apps. They *are* browser processes.\n   */\n  public static get isBrowserProcess() { return typeof window === \"object\" && typeof window.navigator === \"object\"; }\n\n  /** Is this a Node process?\n   * @note this means \"is this a backend process\"? It will return `true` for all backend process, including Electron and mobile apps.\n  */\n  public static get isNodeProcess() { return typeof process === \"object\" && undefined !== process.platform; }\n\n  /** Is this process the frontend of an Electron app? */\n  public static get isElectronAppFrontend() { return typeof navigator === \"object\" && navigator.userAgent.toLowerCase().indexOf(\"electron\") >= 0; }\n\n  /** Is this process the backend of an Electron app? */\n  public static get isElectronAppBackend() { return typeof process === \"object\" && process.versions.hasOwnProperty(\"electron\"); }\n\n  /** Is this process running in a browser on an iPad?\n   * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPadBrowser() {\n    return this.isBrowserProcess && window.navigator.platform === \"iPad\" || (window.navigator.platform === \"MacIntel\" && window.navigator.maxTouchPoints > 0 && !(\"MSStream\" in window)); /* eslint-disable-line @typescript-eslint/no-deprecated */\n  }\n\n  /** Is this process running in a browser on an iPhone?\n   * @note This method will return `true` for any frontend running on an iPhone, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPhoneBrowser() { return this.isBrowserProcess && (/(iphone|ipod)/i.test(window.navigator.userAgent)); }\n\n  /** Is this process running in a browser on an iOS device?\n   * @note This method will return `true` for any frontend running on an iOS device, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n  */\n  public static get isIOSBrowser() { return this.isIPadBrowser || this.isIPhoneBrowser; }\n\n  /** Is this process running in a browser on an Android device?\n   * @note This method will return `true` for any frontend running on an Android device, whether it is a user-launched web browser (e.g. Chrome) or the frontend of a mobile app.\n  */\n  public static get isAndroidBrowser() { return this.isBrowserProcess && /android/i.test(window.navigator.userAgent); }\n\n  /** Is this process running in a browser on a mobile device?\n   * @note This method will return `true` for any frontend running on a mobile device, whether it is a user-launched web browser or the frontend of a mobile app.\n  */\n  public static get isMobileBrowser() { return this.isIOSBrowser || this.isAndroidBrowser; }\n\n  /** Is this process running in a Chromium based browser (Chrome / new Edge / Electron front end)? */\n  public static get isChromium() {\n    return (this.isBrowserProcess && window.navigator.userAgent.indexOf(\"Chrome\") > -1 && window.navigator.userAgent.indexOf(\"OP\") === -1) || this.isElectronAppFrontend;\n  }\n\n  /** Is this process the frontend of an iTwin mobile application?\n   * @note this indicates that this is a browser process started by an iTwin mobile application.\n   * It will return `false` when running user-launched web browsers on a mobile device.\n   */\n  public static get isMobileAppFrontend() { return this.isAndroidAppFrontend || this.isIOSAppFrontend; }\n\n  /** Is this process the frontend of an iOS mobile application? */\n  public static get isIOSAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=ios\") !== -1; }\n\n  /** Is this process the frontend of an Android mobile application? */\n  public static get isAndroidAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=android\") !== -1; }\n\n  /** Is this process the backend of an iOS mobile application? */\n  public static get isIOSAppBackend() { return this.isNodeProcess && (process.platform as any) === \"ios\"; }\n\n  /** Is this process the backend of an Android mobile application? */\n  public static get isAndroidAppBackend() { return this.isNodeProcess && (process.platform as any) === \"android\"; }\n\n  /**  Is this process a mobile app backend? */\n  public static get isMobileAppBackend() { return this.isIOSAppBackend || this.isAndroidAppBackend; }\n\n  /** Is this process the frontend of a native (Electron or Mobile) app? */\n  public static get isNativeAppFrontend() { return this.isElectronAppFrontend || this.isMobileAppFrontend; }\n}\n"]}
+{"version":3,"file":"ProcessDetector.js","sourceRoot":"","sources":["../../src/ProcessDetector.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,OAAO,eAAe;IAE1B;;OAEG;IACI,MAAM,KAAK,gBAAgB,KAAK,OAAO,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC;IAEnH;;MAEE;IACK,MAAM,KAAK,aAAa,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,SAAS,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3G,uDAAuD;IAChD,MAAM,KAAK,qBAAqB,KAAK,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjJ,sDAAsD;IAC/C,MAAM,KAAK,oBAAoB,KAAK,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAE/H,qFAAqF;IAC9E,MAAM,KAAK,WAAW,KAAK,OAAO,CAAC,CAAE,QAAgB,CAAC,YAAY,IAAI,CAAC,CAAE,MAAc,CAAC,UAAU,CAAC,CAAC,CAAC;IAE5G;;OAEG;IACI,MAAM,KAAK,aAAa;QAC7B,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,UAAU,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,0DAA0D;IAClP,CAAC;IAED;;OAEG;IACI,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5H;;MAEE;IACK,MAAM,KAAK,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAEvF;;MAEE;IACK,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAErH;;MAEE;IACK,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAE1F,oGAAoG;IAC7F,MAAM,KAAK,UAAU;QAC1B,OAAO,CAAC,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,qBAAqB,CAAC;IACvK,CAAC;IAED;;;OAGG;IACI,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAEtG,iEAAiE;IAC1D,MAAM,KAAK,gBAAgB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7H,qEAAqE;IAC9D,MAAM,KAAK,oBAAoB,KAAK,OAAO,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAErI,gEAAgE;IACzD,MAAM,KAAK,eAAe,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,KAAK,CAAC,CAAC,CAAC;IAEzG,oEAAoE;IAC7D,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,aAAa,IAAK,OAAO,CAAC,QAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;IAEjH,6CAA6C;IACtC,MAAM,KAAK,kBAAkB,KAAK,OAAO,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAEnG,yEAAyE;IAClE,MAAM,KAAK,mBAAmB,KAAK,OAAO,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;CAC3G","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 ProcessDetector\n */\n\n/** Functions to determine the type of JavaScript process currently executing.\n * @public\n */\nexport class ProcessDetector {\n\n  /** Is this a browser process?\n   * @note this method will also return `true` for the frontend of Electron or Mobile apps. They *are* browser processes.\n   */\n  public static get isBrowserProcess() { return typeof window === \"object\" && typeof window.navigator === \"object\"; }\n\n  /** Is this a Node process?\n   * @note this means \"is this a backend process\"? It will return `true` for all backend process, including Electron and mobile apps.\n  */\n  public static get isNodeProcess() { return typeof process === \"object\" && undefined !== process.platform; }\n\n  /** Is this process the frontend of an Electron app? */\n  public static get isElectronAppFrontend() { return typeof navigator === \"object\" && navigator.userAgent.toLowerCase().indexOf(\"electron\") >= 0; }\n\n  /** Is this process the backend of an Electron app? */\n  public static get isElectronAppBackend() { return typeof process === \"object\" && process.versions.hasOwnProperty(\"electron\"); }\n\n  /** Is this process running in an Internet Explorer or old Microsoft Edge browser? */\n  public static get isIEBrowser() { return !!(document as any).documentMode || !!(window as any).StyleMedia; }\n\n  /** Is this process running in a browser on an iPad?\n   * @note This method will return `true` for any frontend running on an iPad, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPadBrowser() {\n    return this.isBrowserProcess && window.navigator.platform === \"iPad\" || (window.navigator.platform === \"MacIntel\" && window.navigator.maxTouchPoints > 0 && !(\"MSStream\" in window)); /* eslint-disable-line @typescript-eslint/no-deprecated */\n  }\n\n  /** Is this process running in a browser on an iPhone?\n   * @note This method will return `true` for any frontend running on an iPhone, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n   */\n  public static get isIPhoneBrowser() { return this.isBrowserProcess && (/(iphone|ipod)/i.test(window.navigator.userAgent)); }\n\n  /** Is this process running in a browser on an iOS device?\n   * @note This method will return `true` for any frontend running on an iOS device, whether it is a user-launched web browser (e.g. Safari) or the frontend of a mobile app.\n  */\n  public static get isIOSBrowser() { return this.isIPadBrowser || this.isIPhoneBrowser; }\n\n  /** Is this process running in a browser on an Android device?\n   * @note This method will return `true` for any frontend running on an Android device, whether it is a user-launched web browser (e.g. Chrome) or the frontend of a mobile app.\n  */\n  public static get isAndroidBrowser() { return this.isBrowserProcess && /android/i.test(window.navigator.userAgent); }\n\n  /** Is this process running in a browser on a mobile device?\n   * @note This method will return `true` for any frontend running on a mobile device, whether it is a user-launched web browser or the frontend of a mobile app.\n  */\n  public static get isMobileBrowser() { return this.isIOSBrowser || this.isAndroidBrowser; }\n\n  /** Is this process running in a Chromium based browser (Chrome / new Edge / Electron front end)? */\n  public static get isChromium() {\n    return (this.isBrowserProcess && window.navigator.userAgent.indexOf(\"Chrome\") > -1 && window.navigator.userAgent.indexOf(\"OP\") === -1) || this.isElectronAppFrontend;\n  }\n\n  /** Is this process the frontend of an iTwin mobile application?\n   * @note this indicates that this is a browser process started by an iTwin mobile application.\n   * It will return `false` when running user-launched web browsers on a mobile device.\n   */\n  public static get isMobileAppFrontend() { return this.isAndroidAppFrontend || this.isIOSAppFrontend; }\n\n  /** Is this process the frontend of an iOS mobile application? */\n  public static get isIOSAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=ios\") !== -1; }\n\n  /** Is this process the frontend of an Android mobile application? */\n  public static get isAndroidAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=android\") !== -1; }\n\n  /** Is this process the backend of an iOS mobile application? */\n  public static get isIOSAppBackend() { return this.isNodeProcess && (process.platform as any) === \"ios\"; }\n\n  /** Is this process the backend of an Android mobile application? */\n  public static get isAndroidAppBackend() { return this.isNodeProcess && (process.platform as any) === \"android\"; }\n\n  /**  Is this process a mobile app backend? */\n  public static get isMobileAppBackend() { return this.isIOSAppBackend || this.isAndroidAppBackend; }\n\n  /** Is this process the frontend of a native (Electron or Mobile) app? */\n  public static get isNativeAppFrontend() { return this.isElectronAppFrontend || this.isMobileAppFrontend; }\n}\n"]}

package/lib/esm/core-bentley.d.ts

@@ -11,6 +11,7 @@ export * from "./Compare";
 export * from "./CompressedId64Set";
 export * from "./Dictionary";
 export * from "./Disposable";
+export * from "./Expect";
 export * from "./Id";
 export * from "./IndexMap";
 export * from "./JsonSchema";

package/lib/esm/core-bentley.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"core-bentley.d.ts","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAIA,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;AAG/B,cAAc,0BAA0B,CAAC;AAEzC;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG"}
+{"version":3,"file":"core-bentley.d.ts","sourceRoot":"","sources":["../../src/core-bentley.ts"],"names":[],"mappings":"AAIA,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,UAAU,CAAC;AACzB,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;AAG/B,cAAc,0BAA0B,CAAC;AAEzC;;GAEG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG;AACH;;;GAGG"}

package/lib/esm/core-bentley.js

@@ -15,6 +15,7 @@ export * from "./Compare";
 export * from "./CompressedId64Set";
 export * from "./Dictionary";
 export * from "./Disposable";
+export * from "./Expect";
 export * from "./Id";
 export * from "./IndexMap";
 export * from "./JsonSchema";

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,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,oFAAoF;AACpF,cAAc,0BAA0B,CAAC;AAEzC;;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// Temporarily (until 5.0) export top-level internal APIs to avoid breaking callers.\nexport * from \"./internal/cross-package\";\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"]}
+{"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,UAAU,CAAC;AACzB,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,oFAAoF;AACpF,cAAc,0BAA0B,CAAC;AAEzC;;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 \"./Expect\";\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// Temporarily (until 5.0) export top-level internal APIs to avoid breaking callers.\nexport * from \"./internal/cross-package\";\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/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/core-bentley",
-  "version": "5.2.0-dev.3",
+  "version": "5.2.0-dev.31",
   "description": "Bentley JavaScript core components",
   "main": "lib/cjs/core-bentley.js",
   "module": "lib/esm/core-bentley.js",
@@ -30,7 +30,7 @@
     "rimraf": "^6.0.1",
     "typescript": "~5.6.2",
     "vitest": "^3.0.6",
-    "@itwin/build-tools": "5.2.0-dev.3"
+    "@itwin/build-tools": "5.2.0-dev.31"
   },
   "nyc": {
     "extends": "./node_modules/@itwin/build-tools/.nycrc"