npm - @itwin/core-bentley - Versions diffs - 5.1.0 → 5.1.1 - Mend

@itwin/core-bentley 5.1.0 → 5.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (80) hide show

package/CHANGELOG.md +6 -1
package/lib/cjs/AccessToken.js.map +1 -1
package/lib/cjs/Assert.js.map +1 -1
package/lib/cjs/BeEvent.js.map +1 -1
package/lib/cjs/BeSQLite.js.map +1 -1
package/lib/cjs/BentleyError.js.map +1 -1
package/lib/cjs/BentleyLoggerCategory.js.map +1 -1
package/lib/cjs/ByteStream.js.map +1 -1
package/lib/cjs/ClassUtils.js.map +1 -1
package/lib/cjs/Compare.js.map +1 -1
package/lib/cjs/CompressedId64Set.js.map +1 -1
package/lib/cjs/Dictionary.js.map +1 -1
package/lib/cjs/Disposable.js.map +1 -1
package/lib/cjs/Id.js.map +1 -1
package/lib/cjs/IndexMap.js.map +1 -1
package/lib/cjs/JsonSchema.js.map +1 -1
package/lib/cjs/JsonUtils.js.map +1 -1
package/lib/cjs/LRUMap.js.map +1 -1
package/lib/cjs/Logger.js.map +1 -1
package/lib/cjs/ObservableSet.js.map +1 -1
package/lib/cjs/OneAtATimeAction.js.map +1 -1
package/lib/cjs/OrderedId64Iterable.js.map +1 -1
package/lib/cjs/OrderedSet.js.map +1 -1
package/lib/cjs/PriorityQueue.js.map +1 -1
package/lib/cjs/ProcessDetector.js.map +1 -1
package/lib/cjs/SortedArray.js.map +1 -1
package/lib/cjs/StatusCategory.js.map +1 -1
package/lib/cjs/StringUtils.js.map +1 -1
package/lib/cjs/Time.js.map +1 -1
package/lib/cjs/Tracing.js.map +1 -1
package/lib/cjs/TupleKeyedMap.js.map +1 -1
package/lib/cjs/TypedArrayBuilder.js.map +1 -1
package/lib/cjs/UnexpectedErrors.js.map +1 -1
package/lib/cjs/UtilityTypes.js.map +1 -1
package/lib/cjs/YieldManager.js.map +1 -1
package/lib/cjs/core-bentley.js.map +1 -1
package/lib/cjs/internal/BeSQLiteInternal.js.map +1 -1
package/lib/cjs/internal/RepositoryStatus.js.map +1 -1
package/lib/cjs/internal/cross-package.js.map +1 -1
package/lib/cjs/partitionArray.js.map +1 -1
package/lib/esm/AccessToken.js.map +1 -1
package/lib/esm/Assert.js.map +1 -1
package/lib/esm/BeEvent.js.map +1 -1
package/lib/esm/BeSQLite.js.map +1 -1
package/lib/esm/BentleyError.js.map +1 -1
package/lib/esm/BentleyLoggerCategory.js.map +1 -1
package/lib/esm/ByteStream.js.map +1 -1
package/lib/esm/ClassUtils.js.map +1 -1
package/lib/esm/Compare.js.map +1 -1
package/lib/esm/CompressedId64Set.js.map +1 -1
package/lib/esm/Dictionary.js.map +1 -1
package/lib/esm/Disposable.js.map +1 -1
package/lib/esm/Id.js.map +1 -1
package/lib/esm/IndexMap.js.map +1 -1
package/lib/esm/JsonSchema.js.map +1 -1
package/lib/esm/JsonUtils.js.map +1 -1
package/lib/esm/LRUMap.js.map +1 -1
package/lib/esm/Logger.js.map +1 -1
package/lib/esm/ObservableSet.js.map +1 -1
package/lib/esm/OneAtATimeAction.js.map +1 -1
package/lib/esm/OrderedId64Iterable.js.map +1 -1
package/lib/esm/OrderedSet.js.map +1 -1
package/lib/esm/PriorityQueue.js.map +1 -1
package/lib/esm/ProcessDetector.js.map +1 -1
package/lib/esm/SortedArray.js.map +1 -1
package/lib/esm/StatusCategory.js.map +1 -1
package/lib/esm/StringUtils.js.map +1 -1
package/lib/esm/Time.js.map +1 -1
package/lib/esm/Tracing.js.map +1 -1
package/lib/esm/TupleKeyedMap.js.map +1 -1
package/lib/esm/TypedArrayBuilder.js.map +1 -1
package/lib/esm/UnexpectedErrors.js.map +1 -1
package/lib/esm/UtilityTypes.js.map +1 -1
package/lib/esm/YieldManager.js.map +1 -1
package/lib/esm/core-bentley.js.map +1 -1
package/lib/esm/internal/BeSQLiteInternal.js.map +1 -1
package/lib/esm/internal/RepositoryStatus.js.map +1 -1
package/lib/esm/internal/cross-package.js.map +1 -1
package/lib/esm/partitionArray.js.map +1 -1
package/package.json +2 -2

package/lib/cjs/ProcessDetector.js.map CHANGED Viewed

	@@ -1 +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":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module ProcessDetector\r\n /\r\n\r\n/* Functions to determine the type of JavaScript process currently executing.\r\n * @public\r\n /\r\nexport class ProcessDetector {\r\n\r\n /* Is this a browser process?\r\n * @note this method will also return `true` for the frontend of Electron or Mobile apps. They are browser processes.\r\n /\r\n public static get isBrowserProcess() { return typeof window === \"object\" && typeof window.navigator === \"object\"; }\r\n\r\n /* Is this a Node process?\r\n * @note this means \"is this a backend process\"? It will return `true` for all backend process, including Electron and mobile apps.\r\n /\r\n public static get isNodeProcess() { return typeof process === \"object\" && undefined !== process.platform; }\r\n\r\n /* Is this process the frontend of an Electron app? /\r\n public static get isElectronAppFrontend() { return typeof navigator === \"object\" && navigator.userAgent.toLowerCase().indexOf(\"electron\") >= 0; }\r\n\r\n /* Is this process the backend of an Electron app? /\r\n public static get isElectronAppBackend() { return typeof process === \"object\" && process.versions.hasOwnProperty(\"electron\"); }\r\n\r\n /* Is this process running in a browser on an iPad?\r\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.\r\n /\r\n public static get isIPadBrowser() {\r\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 /\r\n }\r\n\r\n /* Is this process running in a browser on an iPhone?\r\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.\r\n /\r\n public static get isIPhoneBrowser() { return this.isBrowserProcess && (/(iphone\|ipod)/i.test(window.navigator.userAgent)); }\r\n\r\n /* Is this process running in a browser on an iOS device?\r\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.\r\n /\r\n public static get isIOSBrowser() { return this.isIPadBrowser \|\| this.isIPhoneBrowser; }\r\n\r\n /* Is this process running in a browser on an Android device?\r\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.\r\n /\r\n public static get isAndroidBrowser() { return this.isBrowserProcess && /android/i.test(window.navigator.userAgent); }\r\n\r\n /* Is this process running in a browser on a mobile device?\r\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.\r\n /\r\n public static get isMobileBrowser() { return this.isIOSBrowser \|\| this.isAndroidBrowser; }\r\n\r\n /* Is this process running in a Chromium based browser (Chrome / new Edge / Electron front end)? /\r\n public static get isChromium() {\r\n return (this.isBrowserProcess && window.navigator.userAgent.indexOf(\"Chrome\") > -1 && window.navigator.userAgent.indexOf(\"OP\") === -1) \|\| this.isElectronAppFrontend;\r\n }\r\n\r\n /* Is this process the frontend of an iTwin mobile application?\r\n * @note this indicates that this is a browser process started by an iTwin mobile application.\r\n * It will return `false` when running user-launched web browsers on a mobile device.\r\n /\r\n public static get isMobileAppFrontend() { return this.isAndroidAppFrontend \|\| this.isIOSAppFrontend; }\r\n\r\n /* Is this process the frontend of an iOS mobile application? /\r\n public static get isIOSAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=ios\") !== -1; }\r\n\r\n /* Is this process the frontend of an Android mobile application? /\r\n public static get isAndroidAppFrontend() { return this.isBrowserProcess && window.location.hash.indexOf(\"platform=android\") !== -1; }\r\n\r\n /* Is this process the backend of an iOS mobile application? /\r\n public static get isIOSAppBackend() { return this.isNodeProcess && (process.platform as any) === \"ios\"; }\r\n\r\n /* Is this process the backend of an Android mobile application? /\r\n public static get isAndroidAppBackend() { return this.isNodeProcess && (process.platform as any) === \"android\"; }\r\n\r\n /* Is this process a mobile app backend? /\r\n public static get isMobileAppBackend() { return this.isIOSAppBackend \|\| this.isAndroidAppBackend; }\r\n\r\n /* Is this process the frontend of a native (Electron or Mobile) app? */\r\n public static get isNativeAppFrontend() { return this.isElectronAppFrontend \|\| this.isMobileAppFrontend; }\r\n}\r\n"]}
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"]}

package/lib/cjs/SortedArray.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"SortedArray.js","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAkBH,oCAEC;AAUD,gCAEC;AArBD;;;;;;GAMG;AACH,SAAgB,YAAY,CAAI,KAAQ;IACtC,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAW,KAAQ,EAAE,IAAS,EAAE,OAAgC;IACxF,OAAO,sBAAsB,CAAC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,sBAAsB,CAAI,IAAS,EAAE,SAAiC;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI;YACZ,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;aAChC,IAAI,IAAI,GAAG,CAAC;YACf,IAAI,GAAG,GAAG,CAAC;;YAEX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,IAAY,eAWX;AAXD,WAAY,eAAe;IACzB;;OAEG;IACH,uDAAK,CAAA;IACL,mJAAmJ;IACnJ,yDAAM,CAAA;IACN;;OAEG;IACH,2DAAO,CAAA;AACT,CAAC,EAXW,eAAe,+BAAf,eAAe,QAW1B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,mBAAmB;IACpB,MAAM,GAAQ,EAAE,CAAC;IACR,QAAQ,CAAuB;IAC/B,MAAM,CAAmB;IACzB,gBAAgB,CAAkB;IAErD;;;;;OAKG;IACH,YAAsB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC7I,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,OAAO,eAAe,KAAK,SAAS;YACtC,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;QAErF,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IAC1C,CAAC;IAED,0CAA0C;IAC1C,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,sDAAsD;IACtD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAElF;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAQ;QACtB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,KAAQ;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,SAAiC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAiC;QACxD,gCAAgC;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAO,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,KAAa,IAAmB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEzG;;OAEG;IACI,OAAO,CAAC,IAAwB;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,qIAAqI;IAC9H,KAAK,CAAC,KAAc,EAAE,GAAY;QACvC,MAAM,KAAK,GAAG,IAAI,mBAAmB,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5F,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACO,UAAU,CAAC,KAAQ,IAAuC,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE3H,+CAA+C;IACrC,MAAM,KAAW,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACO,aAAa;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACO,OAAO,CAAC,KAAQ,EAAE,QAA4B;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAErC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,QAAQ,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC9B,KAAK,eAAe,CAAC,MAAM;oBACzB,OAAO,KAAK,CAAC,KAAK,CAAC;gBACrB,KAAK,eAAe,CAAC,OAAO;oBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9C,IAAI,QAAQ;wBACV,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAElB,OAAO,KAAK,CAAC,KAAK,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACO,OAAO,CAAC,KAAQ;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;CACF;AApLD,kDAoLC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,WAAe,SAAQ,mBAAsB;IACxD;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC1I,KAAK,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,+CAA+C;IACxC,KAAK,KAAW,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEvC;;OAEG;IACI,YAAY,KAAU,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAE3D;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;OAIG;IACI,MAAM,CAAC,KAAQ,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE/D,qIAAqI;IACrH,KAAK,CAAC,KAAc,EAAE,GAAY;QAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACpF,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjDD,kCAiDC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Collections\r\n /\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\n\r\n/\r\n A function that, given a value of type T, returns a copy of that value. Such functions are used by various collection classes.\r\n * It is up to the function to decide how deeply or shallowly the value is cloned. For example, [[shallowClone]] simply returns the input.\r\n * @public\r\n /\r\nexport type CloneFunction<T> = (value: T) => T;\r\n\r\n/\r\n A [[CloneFunction]] that, given a value of type T, returns the same value.\r\n * Useful as a default argument for functions that can alternatively accept custom logic for cloning values of object type.\r\n * @param value The value to clone.\r\n * @returns the input value.\r\n * @public\r\n /\r\nexport function shallowClone<T>(value: T) {\r\n return value;\r\n}\r\n\r\n/\r\n Given a sorted array, computes the position at which the specified value should be inserted into the array so that the array remains sorted.\r\n * @param value The value whose position is to be computed.\r\n * @param list An array of U already sorted according to the comparison criterion.\r\n * @param compare The function used to compare the value with elements in `list`.\r\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n * @public\r\n /\r\nexport function lowerBound<T, U = T>(value: T, list: U[], compare: OrderedComparator<T, U>): { index: number, equal: boolean } {\r\n return lowerBoundOfEquivalent(list, (element: U) => compare(value, element));\r\n}\r\n\r\nfunction lowerBoundOfEquivalent<T>(list: T[], criterion: (element: T) => number): { index: number, equal: boolean } {\r\n let low = 0;\r\n let high = list.length;\r\n while (low < high) {\r\n const mid = Math.floor((low + high) / 2);\r\n const comp = criterion(list[mid]);\r\n if (0 === comp)\r\n return { index: mid, equal: true };\r\n else if (comp < 0)\r\n high = mid;\r\n else\r\n low = mid + 1;\r\n }\r\n\r\n return { index: low, equal: false };\r\n}\r\n\r\n/* Describes how duplicate values are handled when inserting into a [[SortedArray]].\r\n * A \"duplicate\" value is one that compares equal to a value already present in the array, per the array's comparison function.\r\n * @public\r\n /\r\nexport enum DuplicatePolicy {\r\n /* The array allows duplicate values to be inserted. All duplicate values will be adjacent in the array, but the ordering between duplicate values is unspecified.\r\n * @note In the presence of duplicate values, functions like [[SortedArray.indexOf]] and [[SortedArray.findEqual]] will return one of the values - exactly which one is unspecified.\r\n /\r\n Allow,\r\n /* Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is retained. /\r\n Retain,\r\n /* Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is replaced by the new value.\r\n * This can be useful when the value type carries additional data that is not evaluated by the comparison function.\r\n /\r\n Replace,\r\n}\r\n\r\n/\r\n A read-only view of an array of some type T sorted according to some user-supplied criterion.\r\n * Duplicate elements may be present, though sub-types may enforce uniqueness of elements.\r\n * In the absence of duplicates, a ReadonlySortedArray<T> can behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n \r\n Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n \r\n The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n * - If lhs is equal to rhs, returns 0\r\n * - If lhs is less than rhs, returns a negative value\r\n * - If lhs is greater than rhs, returns a positive value\r\n * - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n * - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n \r\n Note that the array is read-only only from the perspective of its public interface. Mutation methods are defined for internal use by sub-types.\r\n \r\n @see [[SortedArray]] for a general-purpose mutable sorted array.\r\n * @public\r\n /\r\nexport class ReadonlySortedArray<T> implements Iterable<T> {\r\n protected _array: T[] = [];\r\n protected readonly _compare: OrderedComparator<T>;\r\n protected readonly _clone: CloneFunction<T>;\r\n protected readonly _duplicatePolicy: DuplicatePolicy;\r\n\r\n /\r\n Construct a new ReadonlySortedArray<T>.\r\n * @param compare The function used to compare elements within the array.\r\n * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n /\r\n protected constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy \| boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n this._compare = compare;\r\n this._clone = clone;\r\n if (typeof duplicatePolicy === \"boolean\")\r\n duplicatePolicy = duplicatePolicy ? DuplicatePolicy.Allow : DuplicatePolicy.Retain;\r\n\r\n this._duplicatePolicy = duplicatePolicy;\r\n }\r\n\r\n /* The number of elements in the array /\r\n public get length(): number { return this._array.length; }\r\n\r\n /* Returns true if the array contains no elements. /\r\n public get isEmpty(): boolean { return 0 === this.length; }\r\n\r\n /* Returns an iterator over the contents of the array in sorted order, suitable for use in `for-of` loops. /\r\n public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\r\n\r\n /\r\n Looks up the index of an element comparing equal to the specified value using binary search.\r\n * @param value The value to search for\r\n * @returns the index of the first equivalent element found in the array, or -1 if no such element exists.\r\n /\r\n public indexOf(value: T): number {\r\n const bound = this.lowerBound(value);\r\n return bound.equal ? bound.index : -1;\r\n }\r\n\r\n /\r\n Returns true if this array contains at least one value comparing equal to the specified value.\r\n * @param value The value to search for\r\n * @returns true if an equivalent element exists in the array.\r\n /\r\n public contains(value: T): boolean {\r\n return -1 !== this.indexOf(value);\r\n }\r\n\r\n /\r\n Looks up an element comparing equal to the specified value using binary search.\r\n * @param value The value to search for\r\n * @returns the first equivalent element found in the array, or undefined if no such element exists.\r\n /\r\n public findEqual(value: T): T \| undefined {\r\n const index = this.indexOf(value);\r\n return -1 !== index ? this._array[index] : undefined;\r\n }\r\n\r\n /* Find an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find a model by its Id,\r\n * use `sortedArray.findEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if it compares as \"less-than\", or a positive value if it compares as \"greater-than\".\r\n * @returns The first element found that meets the criterion, or `undefined` if no elements meet the criterion.\r\n * @see [[indexOfEquivalent]].\r\n * @public\r\n /\r\n public findEquivalent(criterion: (element: T) => number): T \| undefined {\r\n const index = this.indexOfEquivalent(criterion);\r\n return -1 !== index ? this._array[index] : undefined;\r\n }\r\n\r\n /* Find the index of an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find the index of a model by its Id,\r\n * use `sortedArray.indexOfEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if the element compares as \"less-than\", or a positive value if the element compares as \"greater-than\".\r\n * @returns The index of the first element found that meets the criterion, or -1 if no elements meet the criterion.\r\n * @public\r\n /\r\n public indexOfEquivalent(criterion: (element: T) => number): number {\r\n // NB: Must invert the ordering.\r\n const bound = lowerBoundOfEquivalent(this._array, (elem: T) => 0 - criterion(elem));\r\n return bound.equal ? bound.index : -1;\r\n }\r\n\r\n /\r\n Looks up an element by its index in the array.\r\n * @param index The array index\r\n * @returns the element corresponding to that position in the array, or undefined if the supplied index exceeds the length of the array.\r\n /\r\n public get(index: number): T \| undefined { return index < this.length ? this._array[index] : undefined; }\r\n\r\n /* Apply a function to each element in the array, in sorted order.\r\n * @param func The function to be applied.\r\n /\r\n public forEach(func: (value: T) => void): void {\r\n for (let i = 0; i < this.length; i++)\r\n func(this._array[i]);\r\n }\r\n\r\n /* The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). /\r\n public slice(start?: number, end?: number): ReadonlySortedArray<T> {\r\n const slice = new ReadonlySortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\r\n slice._array = this._array.slice(start, end);\r\n return slice;\r\n }\r\n\r\n /\r\n Computes the position at which the specified value should be inserted to maintain sorted order.\r\n * @param value The value whose position is to be computed.\r\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n /\r\n protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, this._compare); }\r\n\r\n /* Clears the contents of the sorted array. /\r\n protected _clear(): void { this._array.length = 0; }\r\n\r\n /* Extracts the sorted array as a T[] and empties the contents of this ReadonlySortedArray.\r\n * @returns the contents of this ReadonlySortedArray as a T[].\r\n /\r\n protected _extractArray(): T[] {\r\n const result = this._array;\r\n this._array = [];\r\n return result;\r\n }\r\n\r\n /\r\n Attempts to insert a new value into the array at a position determined by the ordering.\r\n * The behavior differs based on the array's [[DuplicatePolicy]]:\r\n * If duplicates are not permitted, then:\r\n * - If an equivalent element already exists in the array:\r\n * - [[DuplicatePolicy.Retain]]: nothing will be inserted and the index of the existing element will be returned.\r\n * - [[DuplicatePolicy.Replace]]: the input value will overwrite the existing element at the same index and that index will be returned.\r\n * - Otherwise, the element is inserted and its index is returned.\r\n * If duplicates are permitted, then:\r\n * - The element will be inserted in a correct position based on the sorting criterion;\r\n * - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n * - The actual index of the newly-inserted element is returned.\r\n * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n * @param value The value to insert\r\n * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n /\r\n protected _insert(value: T, onInsert?: (value: T) => any): number {\r\n const bound = this.lowerBound(value);\r\n\r\n if (bound.equal) {\r\n switch (this._duplicatePolicy) {\r\n case DuplicatePolicy.Retain:\r\n return bound.index;\r\n case DuplicatePolicy.Replace:\r\n this._array[bound.index] = this._clone(value);\r\n if (onInsert)\r\n onInsert(value);\r\n\r\n return bound.index;\r\n }\r\n }\r\n\r\n this._array.splice(bound.index, 0, this._clone(value));\r\n if (undefined !== onInsert)\r\n onInsert(value);\r\n\r\n return bound.index;\r\n }\r\n\r\n /\r\n Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n * @param value The value of the element to delete\r\n * @returns the index of the deleted value, or -1 if no such element exists.\r\n /\r\n protected _remove(value: T): number {\r\n const bound = this.lowerBound(value);\r\n if (bound.equal) {\r\n this._array.splice(bound.index, 1);\r\n return bound.index;\r\n } else {\r\n return -1;\r\n }\r\n }\r\n}\r\n\r\n/\r\n Maintains an array of some type T in sorted order. The ordering is specified by a function supplied\r\n * by the user.\r\n * By default, only unique elements are permitted; attempting to insert a new element that compares\r\n * as equal to an element already in the array will not modify the contents of the array.\r\n \r\n This allows a SortedArray<T> to behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n \r\n Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n \r\n The user can also specify how the SortedArray takes ownership of inserted values, e.g., by cloning them.\r\n \r\n The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n * - If lhs is equal to rhs, returns 0\r\n * - If lhs is less than rhs, returns a negative value\r\n * - If lhs is greater than rhs, returns a positive value\r\n * - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n * - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n \r\n Modifying an element in a way that affects the comparison function will produce unpredictable results, the\r\n * most likely of which is that the array will cease to be sorted.\r\n * @public\r\n /\r\nexport class SortedArray<T> extends ReadonlySortedArray<T> {\r\n /\r\n Construct a new SortedArray<T>.\r\n * @param compare The function used to compare elements within the array.\r\n * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n /\r\n public constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy \| boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n super(compare, duplicatePolicy, clone);\r\n }\r\n\r\n /* Clears the contents of the sorted array. /\r\n public clear(): void { this._clear(); }\r\n\r\n /* Extracts the sorted array as a T[] and empties the contents of this SortedArray.\r\n * @returns the contents of this SortedArray as a T[].\r\n /\r\n public extractArray(): T[] { return this._extractArray(); }\r\n\r\n /\r\n Attempts to insert a new value into the array at a position determined by the ordering.\r\n * The behavior differs based on whether or not duplicate elements are permitted.\r\n * If duplicates are not permitted, then:\r\n * - If an equivalent element already exists in the array, nothing will be inserted and the index of the existing element will be returned.\r\n * - Otherwise, the element is inserted and its index is returned.\r\n * If duplicates are permitted, then:\r\n * - The element will be inserted in a correct position based on the sorting criterion;\r\n * - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n * - The actual index of the newly-inserted element is returned.\r\n * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n * @param value The value to insert\r\n * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n /\r\n public insert(value: T, onInsert?: (value: T) => any): number { return this._insert(value, onInsert); }\r\n\r\n /\r\n Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n * @param value The value of the element to delete\r\n * @returns the index of the deleted value, or -1 if no such element exists.\r\n /\r\n public remove(value: T): number { return this._remove(value); }\r\n\r\n /* The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */\r\n public override slice(start?: number, end?: number): SortedArray<T> {\r\n const slice = new SortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\r\n slice._array = this._array.slice(start, end);\r\n return slice;\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"SortedArray.js","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAkBH,oCAEC;AAUD,gCAEC;AArBD;;;;;;GAMG;AACH,SAAgB,YAAY,CAAI,KAAQ;IACtC,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAW,KAAQ,EAAE,IAAS,EAAE,OAAgC;IACxF,OAAO,sBAAsB,CAAC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,sBAAsB,CAAI,IAAS,EAAE,SAAiC;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI;YACZ,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;aAChC,IAAI,IAAI,GAAG,CAAC;YACf,IAAI,GAAG,GAAG,CAAC;;YAEX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,IAAY,eAWX;AAXD,WAAY,eAAe;IACzB;;OAEG;IACH,uDAAK,CAAA;IACL,mJAAmJ;IACnJ,yDAAM,CAAA;IACN;;OAEG;IACH,2DAAO,CAAA;AACT,CAAC,EAXW,eAAe,+BAAf,eAAe,QAW1B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,mBAAmB;IACpB,MAAM,GAAQ,EAAE,CAAC;IACR,QAAQ,CAAuB;IAC/B,MAAM,CAAmB;IACzB,gBAAgB,CAAkB;IAErD;;;;;OAKG;IACH,YAAsB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC7I,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,OAAO,eAAe,KAAK,SAAS;YACtC,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;QAErF,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IAC1C,CAAC;IAED,0CAA0C;IAC1C,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,sDAAsD;IACtD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAElF;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAQ;QACtB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,KAAQ;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,SAAiC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAiC;QACxD,gCAAgC;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAO,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,KAAa,IAAmB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEzG;;OAEG;IACI,OAAO,CAAC,IAAwB;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,qIAAqI;IAC9H,KAAK,CAAC,KAAc,EAAE,GAAY;QACvC,MAAM,KAAK,GAAG,IAAI,mBAAmB,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5F,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACO,UAAU,CAAC,KAAQ,IAAuC,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE3H,+CAA+C;IACrC,MAAM,KAAW,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACO,aAAa;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACO,OAAO,CAAC,KAAQ,EAAE,QAA4B;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAErC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,QAAQ,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC9B,KAAK,eAAe,CAAC,MAAM;oBACzB,OAAO,KAAK,CAAC,KAAK,CAAC;gBACrB,KAAK,eAAe,CAAC,OAAO;oBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9C,IAAI,QAAQ;wBACV,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAElB,OAAO,KAAK,CAAC,KAAK,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACO,OAAO,CAAC,KAAQ;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;CACF;AApLD,kDAoLC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,WAAe,SAAQ,mBAAsB;IACxD;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC1I,KAAK,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,+CAA+C;IACxC,KAAK,KAAW,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEvC;;OAEG;IACI,YAAY,KAAU,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAE3D;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;OAIG;IACI,MAAM,CAAC,KAAQ,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE/D,qIAAqI;IACrH,KAAK,CAAC,KAAc,EAAE,GAAY;QAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACpF,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjDD,kCAiDC","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\";\n\n/\n A function that, given a value of type T, returns a copy of that value. Such functions are used by various collection classes.\n * It is up to the function to decide how deeply or shallowly the value is cloned. For example, [[shallowClone]] simply returns the input.\n * @public\n /\nexport type CloneFunction<T> = (value: T) => T;\n\n/\n A [[CloneFunction]] that, given a value of type T, returns the same value.\n * Useful as a default argument for functions that can alternatively accept custom logic for cloning values of object type.\n * @param value The value to clone.\n * @returns the input value.\n * @public\n /\nexport function shallowClone<T>(value: T) {\n return value;\n}\n\n/\n Given a sorted array, computes the position at which the specified value should be inserted into the array so that the array remains sorted.\n * @param value The value whose position is to be computed.\n * @param list An array of U already sorted according to the comparison criterion.\n * @param compare The function used to compare the value with elements in `list`.\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\n * @public\n /\nexport function lowerBound<T, U = T>(value: T, list: U[], compare: OrderedComparator<T, U>): { index: number, equal: boolean } {\n return lowerBoundOfEquivalent(list, (element: U) => compare(value, element));\n}\n\nfunction lowerBoundOfEquivalent<T>(list: T[], criterion: (element: T) => number): { index: number, equal: boolean } {\n let low = 0;\n let high = list.length;\n while (low < high) {\n const mid = Math.floor((low + high) / 2);\n const comp = criterion(list[mid]);\n if (0 === comp)\n return { index: mid, equal: true };\n else if (comp < 0)\n high = mid;\n else\n low = mid + 1;\n }\n\n return { index: low, equal: false };\n}\n\n/* Describes how duplicate values are handled when inserting into a [[SortedArray]].\n * A \"duplicate\" value is one that compares equal to a value already present in the array, per the array's comparison function.\n * @public\n /\nexport enum DuplicatePolicy {\n /* The array allows duplicate values to be inserted. All duplicate values will be adjacent in the array, but the ordering between duplicate values is unspecified.\n * @note In the presence of duplicate values, functions like [[SortedArray.indexOf]] and [[SortedArray.findEqual]] will return one of the values - exactly which one is unspecified.\n /\n Allow,\n /* Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is retained. /\n Retain,\n /* Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is replaced by the new value.\n * This can be useful when the value type carries additional data that is not evaluated by the comparison function.\n /\n Replace,\n}\n\n/\n A read-only view of an array of some type T sorted according to some user-supplied criterion.\n * Duplicate elements may be present, though sub-types may enforce uniqueness of elements.\n * In the absence of duplicates, a ReadonlySortedArray<T> can behave like a Set<T> where T is an object and equality is determined\n * by some criterion other than object identity.\n \n Because the array is always sorted, querying for the presence of an element is performed using binary\n * search, which is more efficient than a linear search for reasonably large arrays.\n \n The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\n * - If lhs is equal to rhs, returns 0\n * - If lhs is less than rhs, returns a negative value\n * - If lhs is greater than rhs, returns a positive value\n * - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\n * - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\n \n Note that the array is read-only only from the perspective of its public interface. Mutation methods are defined for internal use by sub-types.\n \n @see [[SortedArray]] for a general-purpose mutable sorted array.\n * @public\n /\nexport class ReadonlySortedArray<T> implements Iterable<T> {\n protected _array: T[] = [];\n protected readonly _compare: OrderedComparator<T>;\n protected readonly _clone: CloneFunction<T>;\n protected readonly _duplicatePolicy: DuplicatePolicy;\n\n /\n Construct a new ReadonlySortedArray<T>.\n * @param compare The function used to compare elements within the array.\n * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\n * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\n /\n protected constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy \| boolean = false, clone: CloneFunction<T> = shallowClone) {\n this._compare = compare;\n this._clone = clone;\n if (typeof duplicatePolicy === \"boolean\")\n duplicatePolicy = duplicatePolicy ? DuplicatePolicy.Allow : DuplicatePolicy.Retain;\n\n this._duplicatePolicy = duplicatePolicy;\n }\n\n /* The number of elements in the array /\n public get length(): number { return this._array.length; }\n\n /* Returns true if the array contains no elements. /\n public get isEmpty(): boolean { return 0 === this.length; }\n\n /* Returns an iterator over the contents of the array in sorted order, suitable for use in `for-of` loops. /\n public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\n\n /\n Looks up the index of an element comparing equal to the specified value using binary search.\n * @param value The value to search for\n * @returns the index of the first equivalent element found in the array, or -1 if no such element exists.\n /\n public indexOf(value: T): number {\n const bound = this.lowerBound(value);\n return bound.equal ? bound.index : -1;\n }\n\n /\n Returns true if this array contains at least one value comparing equal to the specified value.\n * @param value The value to search for\n * @returns true if an equivalent element exists in the array.\n /\n public contains(value: T): boolean {\n return -1 !== this.indexOf(value);\n }\n\n /\n Looks up an element comparing equal to the specified value using binary search.\n * @param value The value to search for\n * @returns the first equivalent element found in the array, or undefined if no such element exists.\n /\n public findEqual(value: T): T \| undefined {\n const index = this.indexOf(value);\n return -1 !== index ? this._array[index] : undefined;\n }\n\n /* Find an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\n * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find a model by its Id,\n * use `sortedArray.findEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\n * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if it compares as \"less-than\", or a positive value if it compares as \"greater-than\".\n * @returns The first element found that meets the criterion, or `undefined` if no elements meet the criterion.\n * @see [[indexOfEquivalent]].\n * @public\n /\n public findEquivalent(criterion: (element: T) => number): T \| undefined {\n const index = this.indexOfEquivalent(criterion);\n return -1 !== index ? this._array[index] : undefined;\n }\n\n /* Find the index of an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\n * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find the index of a model by its Id,\n * use `sortedArray.indexOfEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\n * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if the element compares as \"less-than\", or a positive value if the element compares as \"greater-than\".\n * @returns The index of the first element found that meets the criterion, or -1 if no elements meet the criterion.\n * @public\n /\n public indexOfEquivalent(criterion: (element: T) => number): number {\n // NB: Must invert the ordering.\n const bound = lowerBoundOfEquivalent(this._array, (elem: T) => 0 - criterion(elem));\n return bound.equal ? bound.index : -1;\n }\n\n /\n Looks up an element by its index in the array.\n * @param index The array index\n * @returns the element corresponding to that position in the array, or undefined if the supplied index exceeds the length of the array.\n /\n public get(index: number): T \| undefined { return index < this.length ? this._array[index] : undefined; }\n\n /* Apply a function to each element in the array, in sorted order.\n * @param func The function to be applied.\n /\n public forEach(func: (value: T) => void): void {\n for (let i = 0; i < this.length; i++)\n func(this._array[i]);\n }\n\n /* The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). /\n public slice(start?: number, end?: number): ReadonlySortedArray<T> {\n const slice = new ReadonlySortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\n slice._array = this._array.slice(start, end);\n return slice;\n }\n\n /\n Computes the position at which the specified value should be inserted to maintain sorted order.\n * @param value The value whose position is to be computed.\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\n /\n protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, this._compare); }\n\n /* Clears the contents of the sorted array. /\n protected _clear(): void { this._array.length = 0; }\n\n /* Extracts the sorted array as a T[] and empties the contents of this ReadonlySortedArray.\n * @returns the contents of this ReadonlySortedArray as a T[].\n /\n protected _extractArray(): T[] {\n const result = this._array;\n this._array = [];\n return result;\n }\n\n /\n Attempts to insert a new value into the array at a position determined by the ordering.\n * The behavior differs based on the array's [[DuplicatePolicy]]:\n * If duplicates are not permitted, then:\n * - If an equivalent element already exists in the array:\n * - [[DuplicatePolicy.Retain]]: nothing will be inserted and the index of the existing element will be returned.\n * - [[DuplicatePolicy.Replace]]: the input value will overwrite the existing element at the same index and that index will be returned.\n * - Otherwise, the element is inserted and its index is returned.\n * If duplicates are permitted, then:\n * - The element will be inserted in a correct position based on the sorting criterion;\n * - The position of the element relative to other elements comparing as equal to it is unspecified; and\n * - The actual index of the newly-inserted element is returned.\n * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\n * @param value The value to insert\n * @param onInsert The optional callback method to call if insertion occurs with the inserted value\n * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\n /\n protected _insert(value: T, onInsert?: (value: T) => any): number {\n const bound = this.lowerBound(value);\n\n if (bound.equal) {\n switch (this._duplicatePolicy) {\n case DuplicatePolicy.Retain:\n return bound.index;\n case DuplicatePolicy.Replace:\n this._array[bound.index] = this._clone(value);\n if (onInsert)\n onInsert(value);\n\n return bound.index;\n }\n }\n\n this._array.splice(bound.index, 0, this._clone(value));\n if (undefined !== onInsert)\n onInsert(value);\n\n return bound.index;\n }\n\n /\n Removes the first occurrence of a value comparing equal to the specified value from the array.\n * @param value The value of the element to delete\n * @returns the index of the deleted value, or -1 if no such element exists.\n /\n protected _remove(value: T): number {\n const bound = this.lowerBound(value);\n if (bound.equal) {\n this._array.splice(bound.index, 1);\n return bound.index;\n } else {\n return -1;\n }\n }\n}\n\n/\n Maintains an array of some type T in sorted order. The ordering is specified by a function supplied\n * by the user.\n * By default, only unique elements are permitted; attempting to insert a new element that compares\n * as equal to an element already in the array will not modify the contents of the array.\n \n This allows a SortedArray<T> to behave like a Set<T> where T is an object and equality is determined\n * by some criterion other than object identity.\n \n Because the array is always sorted, querying for the presence of an element is performed using binary\n * search, which is more efficient than a linear search for reasonably large arrays.\n \n The user can also specify how the SortedArray takes ownership of inserted values, e.g., by cloning them.\n \n The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\n * - If lhs is equal to rhs, returns 0\n * - If lhs is less than rhs, returns a negative value\n * - If lhs is greater than rhs, returns a positive value\n * - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\n * - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\n \n Modifying an element in a way that affects the comparison function will produce unpredictable results, the\n * most likely of which is that the array will cease to be sorted.\n * @public\n /\nexport class SortedArray<T> extends ReadonlySortedArray<T> {\n /\n Construct a new SortedArray<T>.\n * @param compare The function used to compare elements within the array.\n * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\n * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\n /\n public constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy \| boolean = false, clone: CloneFunction<T> = shallowClone) {\n super(compare, duplicatePolicy, clone);\n }\n\n /* Clears the contents of the sorted array. /\n public clear(): void { this._clear(); }\n\n /* Extracts the sorted array as a T[] and empties the contents of this SortedArray.\n * @returns the contents of this SortedArray as a T[].\n /\n public extractArray(): T[] { return this._extractArray(); }\n\n /\n Attempts to insert a new value into the array at a position determined by the ordering.\n * The behavior differs based on whether or not duplicate elements are permitted.\n * If duplicates are not permitted, then:\n * - If an equivalent element already exists in the array, nothing will be inserted and the index of the existing element will be returned.\n * - Otherwise, the element is inserted and its index is returned.\n * If duplicates are permitted, then:\n * - The element will be inserted in a correct position based on the sorting criterion;\n * - The position of the element relative to other elements comparing as equal to it is unspecified; and\n * - The actual index of the newly-inserted element is returned.\n * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\n * @param value The value to insert\n * @param onInsert The optional callback method to call if insertion occurs with the inserted value\n * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\n /\n public insert(value: T, onInsert?: (value: T) => any): number { return this._insert(value, onInsert); }\n\n /\n Removes the first occurrence of a value comparing equal to the specified value from the array.\n * @param value The value of the element to delete\n * @returns the index of the deleted value, or -1 if no such element exists.\n /\n public remove(value: T): number { return this._remove(value); }\n\n /* The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */\n public override slice(start?: number, end?: number): SortedArray<T> {\n const slice = new SortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\n slice._array = this._array.slice(start, end);\n return slice;\n }\n}\n"]}

package/lib/cjs/StatusCategory.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"StatusCategory.js","sourceRoot":"","sources":["../../src/StatusCategory.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAWwB;AACxB,kEAA+D;AAO/D;;GAEG;AACH,MAAsB,cAAc;IAC3B,MAAM,CAAC,QAAQ,GAA+B,IAAI,GAAG,EAAE,CAAC;IAExD,MAAM,CAAC,GAAG,CAAC,KAAY;QAC5B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAI,KAAsB,CAAC,WAAsB,CAAC;QACnE,IAAI,OAAO,WAAW,KAAK,QAAQ;YACjC,OAAO,wBAAwB,CAAC,WAAW,CAAC,CAAC;QAE/C,OAAO,IAAI,YAAY,EAAE,CAAC;IAC5B,CAAC;;AAhBH,wCAqBC;AAED;;;GAGG;AACH,MAAsB,eAAgB,SAAQ,cAAc;IACnD,KAAK,GAAG,KAAK,CAAC;CACtB;AAFD,0CAEC;AAED;;;GAGG;AACH,MAAsB,aAAc,SAAQ,cAAc;IACjD,KAAK,GAAG,IAAI,CAAC;CACrB;AAFD,sCAEC;AAED,IAAU,IAAI,CAsBb;AAtBD,WAAU,IAAI;IACZ,MAAa,EAAG,SAAQ,eAAe;QAAU,IAAI,GAAG,IAAI,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArE,OAAE,KAAmE,CAAA;IAClF,MAAa,QAAS,SAAQ,eAAe;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjF,aAAQ,WAAyE,CAAA;IAC9F,MAAa,SAAU,SAAQ,eAAe;QAAU,IAAI,GAAG,WAAW,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnF,cAAS,YAA0E,CAAA;IAEhG,MAAa,UAAW,SAAQ,aAAa;QAAU,IAAI,GAAG,YAAY,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnF,eAAU,aAAyE,CAAA;IAChG,MAAa,YAAa,SAAQ,aAAa;QAAU,IAAI,GAAG,cAAc,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvF,iBAAY,eAA2E,CAAA;IACpG,MAAa,SAAU,SAAQ,aAAa;QAAU,IAAI,GAAG,WAAW,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjF,cAAS,YAAwE,CAAA;IAC9F,MAAa,QAAS,SAAQ,aAAa;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA/E,aAAQ,WAAuE,CAAA;IAC5F,MAAa,cAAe,SAAQ,aAAa;QAAU,IAAI,GAAG,gBAAgB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA3F,mBAAc,iBAA6E,CAAA;IACxG,MAAa,QAAS,SAAQ,aAAa;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA/E,aAAQ,WAAuE,CAAA;IAC5F,MAAa,IAAK,SAAQ,aAAa;QAAU,IAAI,GAAG,MAAM,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvE,SAAI,OAAmE,CAAA;IACpF,MAAa,kBAAmB,SAAQ,aAAa;QAAU,IAAI,GAAG,oBAAoB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnG,uBAAkB,qBAAiF,CAAA;IAChH,MAAa,iBAAkB,SAAQ,aAAa;QAAU,IAAI,GAAG,mBAAmB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjG,sBAAiB,oBAAgF,CAAA;IAC9G,MAAa,kBAAmB,SAAQ,aAAa;QAAU,IAAI,GAAG,oBAAoB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnG,uBAAkB,qBAAiF,CAAA;IAChH,MAAa,mBAAoB,SAAQ,aAAa;QAAU,IAAI,GAAG,qBAAqB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArG,wBAAmB,sBAAkF,CAAA;IAClH,MAAa,eAAgB,SAAQ,aAAa;QAAU,IAAI,GAAG,iBAAiB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA7F,oBAAe,kBAA8E,CAAA;IAC1G,MAAa,oBAAqB,SAAQ,aAAa;QAAU,IAAI,GAAG,sBAAsB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvG,yBAAoB,uBAAmF,CAAA;IACpH,MAAa,eAAgB,SAAQ,aAAa;QAAU,IAAI,GAAG,iBAAiB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA7F,oBAAe,kBAA8E,CAAA;IAE1G,MAAa,mBAAoB,SAAQ,aAAa;QAAU,IAAI,GAAG,qBAAqB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArG,wBAAmB,sBAAkF,CAAA;IAClH,MAAa,cAAe,SAAQ,aAAa;QAAU,IAAI,GAAG,gBAAgB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA3F,mBAAc,iBAA6E,CAAA;AAC1G,CAAC,EAtBS,IAAI,KAAJ,IAAI,QAsBb;AAED,MAAM,OAAQ,SAAQ,IAAI,CAAC,EAAE;CAAI;AAEjC,MAAM,OAAQ,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAEvC,MAAM,SAAU,SAAQ,IAAI,CAAC,SAAS;CAAI;AAC1C,MAAM,WAAY,SAAQ,IAAI,CAAC,SAAS;CAAI;AAE5C,MAAM,UAAW,SAAQ,IAAI,CAAC,UAAU;CAAI;AAE5C,MAAM,SAAU,SAAQ,IAAI,CAAC,SAAS;CAAI;AAC1C,MAAM,oBAAqB,SAAQ,IAAI,CAAC,SAAS;CAAI;AACrD,MAAM,QAAS,SAAQ,IAAI,CAAC,SAAS;CAAI;AAEzC,MAAM,QAAS,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAExC,MAAM,UAAW,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACrD,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,eAAgB,SAAQ,IAAI,CAAC,UAAU;CAAI;AAEjD,MAAM,OAAQ,SAAQ,IAAI,CAAC,cAAc;CAAI;AAE7C,MAAM,QAAS,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAExC,MAAM,SAAU,SAAQ,IAAI,CAAC,IAAI;CAAI;AAErC,MAAM,mBAAoB,SAAQ,IAAI,CAAC,SAAS;CAAI;AACpD,MAAM,mBAAoB,SAAQ,IAAI,CAAC,SAAS;CAAI;AAEpD,MAAM,UAAW,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACrD,MAAM,WAAY,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACtD,MAAM,eAAgB,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAC1D,MAAM,cAAe,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEzD,MAAM,MAAO,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAEtC,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,SAAU,SAAQ,IAAI,CAAC,eAAe;CAAI;AAEhD,MAAM,eAAgB,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAC1D,MAAM,aAAc,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACxD,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,cAAe,SAAQ,IAAI,CAAC,cAAc;CAAI;AAEpD,MAAM,OAAQ,SAAQ,IAAI,CAAC,UAAU;CAAI;AAEzC,SAAS,wBAAwB,CAAC,UAAkB;IAClD,QAAQ,UAAU,EAAE,CAAC;QACnB,KAAK,4BAAa,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACjD,KAAK,4BAAa,CAAC,KAAK,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAEpD,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAChD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,MAAM,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACzE,KAAK,2BAAY,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACzE,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACrD,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACxD,KAAK,2BAAY,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACpE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjE,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACjE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACxE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACpD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAEhD,KAAK,8BAAe,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC5D,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAE7E,KAAK,iCAAkB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACtD,KAAK,iCAAkB,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAE9E,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACnD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACxD,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,+BAA+B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC5E,KAAK,8BAAe,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAE3E,KAAK,mCAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACpD,KAAK,mCAAgB,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACnE,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,mCAAgB,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAC3D,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACjE,KAAK,mCAAgB,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvE,KAAK,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC5D,KAAK,mCAAgB,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QACxE,KAAK,mCAAgB,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAChE,KAAK,mCAAgB,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACrE,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC5D,KAAK,mCAAgB,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,mCAAgB,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QAC9D,KAAK,mCAAgB,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAEnF,KAAK,yBAAU,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAE9C,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACnD,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACxD,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QAClF,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QAC9E,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,4BAA4B,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QACrF,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,gCAAgC,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC9E,KAAK,8BAAe,CAAC,yCAAyC,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACvF,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,8BAA8B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,6BAA6B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC1E,KAAK,8BAAe,CAAC,8BAA8B,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjF,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,4BAA4B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChF,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1E,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAEjE,KAAK,+BAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACpD,KAAK,+BAAgB,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,+BAAgB,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,+BAAgB,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5E,KAAK,+BAAgB,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,+BAAgB,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9E,KAAK,+BAAgB,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC7D,KAAK,+BAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC,CAAC,uDAAuD;QAE5G,KAAK,gCAAiB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACrD,KAAK,gCAAiB,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAE7D,OAAO,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;IACrC,CAAC;AACH,CAAC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Errors\r\n /\r\n\r\nimport {\r\n BentleyError,\r\n BentleyStatus,\r\n BriefcaseStatus,\r\n ChangeSetStatus,\r\n GeoServiceStatus,\r\n HttpStatus,\r\n IModelHubStatus,\r\n IModelStatus,\r\n RealityDataStatus,\r\n RpcInterfaceStatus,\r\n} from \"./BentleyError\";\r\nimport { RepositoryStatus } from \"./internal/RepositoryStatus\";\r\n\r\n/ eslint-disable @typescript-eslint/no-shadow /\r\n\r\n/* @alpha /\r\nexport type StatusCategoryHandler = (error: Error) => StatusCategory \| undefined;\r\n\r\n/* A group of related statuses for aggregate reporting purposes.\r\n * @alpha\r\n /\r\nexport abstract class StatusCategory {\r\n public static handlers: Set<StatusCategoryHandler> = new Set();\r\n\r\n public static for(error: Error): StatusCategory {\r\n for (const handler of this.handlers) {\r\n const category = handler(error);\r\n if (category) {\r\n return category;\r\n }\r\n }\r\n\r\n const errorNumber = (error as BentleyError).errorNumber as unknown;\r\n if (typeof errorNumber === \"number\")\r\n return lookupHttpStatusCategory(errorNumber);\r\n\r\n return new UnknownError();\r\n }\r\n\r\n public abstract name: string;\r\n public abstract code: number;\r\n public abstract error: boolean;\r\n}\r\n\r\n/*\r\n A success status.\r\n * @alpha\r\n /\r\nexport abstract class SuccessCategory extends StatusCategory {\r\n public error = false;\r\n}\r\n\r\n/\r\n An error status.\r\n * @alpha\r\n */\r\nexport abstract class ErrorCategory extends StatusCategory {\r\n public error = true;\r\n}\r\n\r\nnamespace HTTP {\r\n export class OK extends SuccessCategory { public name = \"OK\"; public code = 200; }\r\n export class Accepted extends SuccessCategory { public name = \"Accepted\"; public code = 202; }\r\n export class NoContent extends SuccessCategory { public name = \"NoContent\"; public code = 204; }\r\n\r\n export class BadRequest extends ErrorCategory { public name = \"BadRequest\"; public code = 400; }\r\n export class Unauthorized extends ErrorCategory { public name = \"Unauthorized\"; public code = 401; }\r\n export class Forbidden extends ErrorCategory { public name = \"Forbidden\"; public code = 403; }\r\n export class NotFound extends ErrorCategory { public name = \"NotFound\"; public code = 404; }\r\n export class RequestTimeout extends ErrorCategory { public name = \"RequestTimeout\"; public code = 408; }\r\n export class Conflict extends ErrorCategory { public name = \"Conflict\"; public code = 409; }\r\n export class Gone extends ErrorCategory { public name = \"Gone\"; public code = 410; }\r\n export class PreconditionFailed extends ErrorCategory { public name = \"PreconditionFailed\"; public code = 412; }\r\n export class ExpectationFailed extends ErrorCategory { public name = \"ExpectationFailed\"; public code = 417; }\r\n export class MisdirectedRequest extends ErrorCategory { public name = \"MisdirectedRequest\"; public code = 421; }\r\n export class UnprocessableEntity extends ErrorCategory { public name = \"UnprocessableEntity\"; public code = 422; }\r\n export class UpgradeRequired extends ErrorCategory { public name = \"UpgradeRequired\"; public code = 426; }\r\n export class PreconditionRequired extends ErrorCategory { public name = \"PreconditionRequired\"; public code = 428; }\r\n export class TooManyRequests extends ErrorCategory { public name = \"TooManyRequests\"; public code = 429; }\r\n\r\n export class InternalServerError extends ErrorCategory { public name = \"InternalServerError\"; public code = 500; }\r\n export class NotImplemented extends ErrorCategory { public name = \"NotImplemented\"; public code = 501; }\r\n}\r\n\r\nclass Success extends HTTP.OK { }\r\n\r\nclass Pending extends HTTP.Accepted { }\r\n\r\nclass NoContent extends HTTP.NoContent { }\r\nclass NothingToDo extends HTTP.NoContent { }\r\n\r\nclass BadRequest extends HTTP.BadRequest { }\r\n\r\nclass Forbidden extends HTTP.Forbidden { }\r\nclass PermissionsViolation extends HTTP.Forbidden { }\r\nclass ReadOnly extends HTTP.Forbidden { }\r\n\r\nclass NotFound extends HTTP.NotFound { }\r\n\r\nclass NotEnabled extends HTTP.UnprocessableEntity { }\r\nclass NotSupported extends HTTP.UnprocessableEntity { }\r\n\r\nclass ValidationError extends HTTP.BadRequest { }\r\n\r\nclass Timeout extends HTTP.RequestTimeout { }\r\n\r\nclass Conflict extends HTTP.Conflict { }\r\n\r\nclass Cancelled extends HTTP.Gone { }\r\n\r\nclass ConstraintViolation extends HTTP.Forbidden { }\r\nclass VersioningViolation extends HTTP.Forbidden { }\r\n\r\nclass Corruption extends HTTP.InternalServerError { }\r\nclass InvalidData extends HTTP.InternalServerError { }\r\nclass OperationFailed extends HTTP.InternalServerError { }\r\nclass StateViolation extends HTTP.InternalServerError { }\r\n\r\nclass Locked extends HTTP.Conflict { }\r\n\r\nclass NetworkError extends HTTP.InternalServerError { }\r\n\r\nclass Throttled extends HTTP.TooManyRequests { }\r\n\r\nclass FileSystemError extends HTTP.InternalServerError { }\r\nclass InternalError extends HTTP.InternalServerError { }\r\nclass UnknownError extends HTTP.InternalServerError { }\r\n\r\nclass NotImplemented extends HTTP.NotImplemented { }\r\n\r\nclass Aborted extends HTTP.BadRequest { }\r\n\r\nfunction lookupHttpStatusCategory(statusCode: number): StatusCategory {\r\n switch (statusCode) {\r\n case BentleyStatus.SUCCESS: return new Success();\r\n case BentleyStatus.ERROR: return new UnknownError();\r\n\r\n case IModelStatus.Success: return new Success();\r\n case IModelStatus.AlreadyLoaded: return new StateViolation();\r\n case IModelStatus.AlreadyOpen: return new StateViolation();\r\n case IModelStatus.BadArg: return new ValidationError();\r\n case IModelStatus.BadElement: return new ValidationError();\r\n case IModelStatus.BadModel: return new ValidationError();\r\n case IModelStatus.BadRequest: return new BadRequest();\r\n case IModelStatus.BadSchema: return new ValidationError();\r\n case IModelStatus.CannotUndo: return new OperationFailed();\r\n case IModelStatus.CodeNotReserved: return new StateViolation();\r\n case IModelStatus.DeletionProhibited: return new Forbidden();\r\n case IModelStatus.DuplicateCode: return new Conflict();\r\n case IModelStatus.DuplicateName: return new Conflict();\r\n case IModelStatus.ElementBlockedChange: return new ConstraintViolation();\r\n case IModelStatus.FileAlreadyExists: return new Conflict();\r\n case IModelStatus.FileNotFound: return new NotFound();\r\n case IModelStatus.FileNotLoaded: return new FileSystemError();\r\n case IModelStatus.ForeignKeyConstraint: return new ConstraintViolation();\r\n case IModelStatus.IdExists: return new Conflict();\r\n case IModelStatus.InDynamicTransaction: return new StateViolation();\r\n case IModelStatus.InvalidCategory: return new ValidationError();\r\n case IModelStatus.InvalidCode: return new ValidationError();\r\n case IModelStatus.InvalidCodeSpec: return new ValidationError();\r\n case IModelStatus.InvalidId: return new ValidationError();\r\n case IModelStatus.InvalidName: return new ValidationError();\r\n case IModelStatus.InvalidParent: return new Conflict();\r\n case IModelStatus.InvalidProfileVersion: return new InvalidData();\r\n case IModelStatus.IsCreatingChangeSet: return new StateViolation();\r\n case IModelStatus.LockNotHeld: return new Forbidden();\r\n case IModelStatus.Mismatch2d3d: return new ValidationError();\r\n case IModelStatus.MismatchGcs: return new ValidationError();\r\n case IModelStatus.MissingDomain: return new ValidationError();\r\n case IModelStatus.MissingHandler: return new ValidationError();\r\n case IModelStatus.MissingId: return new ValidationError();\r\n case IModelStatus.NoGeometry: return new NoContent();\r\n case IModelStatus.NoMultiTxnOperation: return new StateViolation();\r\n case IModelStatus.NotEnabled: return new NotEnabled();\r\n case IModelStatus.NotFound: return new NotFound();\r\n case IModelStatus.NotOpen: return new StateViolation();\r\n case IModelStatus.NotOpenForWrite: return new Forbidden();\r\n case IModelStatus.NotSameUnitBase: return new ValidationError();\r\n case IModelStatus.NothingToRedo: return new NothingToDo();\r\n case IModelStatus.NothingToUndo: return new NothingToDo();\r\n case IModelStatus.ParentBlockedChange: return new Forbidden();\r\n case IModelStatus.ReadError: return new FileSystemError();\r\n case IModelStatus.ReadOnly: return new ReadOnly();\r\n case IModelStatus.ReadOnlyDomain: return new ReadOnly();\r\n case IModelStatus.RepositoryManagerError: return new NetworkError();\r\n case IModelStatus.SQLiteError: return new InternalError();\r\n case IModelStatus.TransactionActive: return new StateViolation();\r\n case IModelStatus.UnitsMissing: return new ValidationError();\r\n case IModelStatus.UnknownFormat: return new InvalidData();\r\n case IModelStatus.UpgradeFailed: return new OperationFailed();\r\n case IModelStatus.ValidationFailed: return new ValidationError();\r\n case IModelStatus.VersionTooNew: return new VersioningViolation();\r\n case IModelStatus.VersionTooOld: return new VersioningViolation();\r\n case IModelStatus.ViewNotFound: return new NotFound();\r\n case IModelStatus.WriteError: return new FileSystemError();\r\n case IModelStatus.WrongClass: return new ValidationError();\r\n case IModelStatus.WrongIModel: return new ValidationError();\r\n case IModelStatus.WrongDomain: return new ValidationError();\r\n case IModelStatus.WrongElement: return new ValidationError();\r\n case IModelStatus.WrongHandler: return new ValidationError();\r\n case IModelStatus.WrongModel: return new ValidationError();\r\n case IModelStatus.ConstraintNotUnique: return new ConstraintViolation();\r\n case IModelStatus.NoGeoLocation: return new ValidationError();\r\n case IModelStatus.ServerTimeout: return new Timeout();\r\n case IModelStatus.NoContent: return new NoContent();\r\n case IModelStatus.NotRegistered: return new NotImplemented();\r\n case IModelStatus.FunctionNotFound: return new NotImplemented();\r\n case IModelStatus.NoActiveCommand: return new StateViolation();\r\n case IModelStatus.Aborted: return new Aborted();\r\n\r\n case BriefcaseStatus.CannotAcquire: return new OperationFailed();\r\n case BriefcaseStatus.CannotDownload: return new OperationFailed();\r\n case BriefcaseStatus.CannotUpload: return new OperationFailed();\r\n case BriefcaseStatus.CannotCopy: return new OperationFailed();\r\n case BriefcaseStatus.CannotDelete: return new OperationFailed();\r\n case BriefcaseStatus.VersionNotFound: return new NotFound();\r\n case BriefcaseStatus.CannotApplyChanges: return new OperationFailed();\r\n case BriefcaseStatus.DownloadCancelled: return new Cancelled();\r\n case BriefcaseStatus.ContainsDeletedChangeSets: return new ValidationError();\r\n\r\n case RpcInterfaceStatus.Success: return new Success();\r\n case RpcInterfaceStatus.IncompatibleVersion: return new VersioningViolation();\r\n\r\n case ChangeSetStatus.Success: return new Success();\r\n case ChangeSetStatus.ApplyError: return new OperationFailed();\r\n case ChangeSetStatus.ChangeTrackingNotEnabled: return new NotEnabled();\r\n case ChangeSetStatus.CorruptedChangeStream: return new Corruption();\r\n case ChangeSetStatus.FileNotFound: return new NotFound();\r\n case ChangeSetStatus.FileWriteError: return new FileSystemError();\r\n case ChangeSetStatus.HasLocalChanges: return new StateViolation();\r\n case ChangeSetStatus.HasUncommittedChanges: return new StateViolation();\r\n case ChangeSetStatus.InvalidId: return new Corruption();\r\n case ChangeSetStatus.InvalidVersion: return new Corruption();\r\n case ChangeSetStatus.InDynamicTransaction: return new StateViolation();\r\n case ChangeSetStatus.IsCreatingChangeSet: return new StateViolation();\r\n case ChangeSetStatus.IsNotCreatingChangeSet: return new StateViolation();\r\n case ChangeSetStatus.MergePropagationError: return new OperationFailed();\r\n case ChangeSetStatus.NothingToMerge: return new NothingToDo();\r\n case ChangeSetStatus.NoTransactions: return new OperationFailed();\r\n case ChangeSetStatus.ParentMismatch: return new ValidationError();\r\n case ChangeSetStatus.SQLiteError: return new InternalError();\r\n case ChangeSetStatus.WrongDgnDb: return new ValidationError();\r\n case ChangeSetStatus.CouldNotOpenDgnDb: return new OperationFailed();\r\n case ChangeSetStatus.MergeSchemaChangesOnOpen: return new BadRequest();\r\n case ChangeSetStatus.ReverseOrReinstateSchemaChanges: return new Conflict();\r\n case ChangeSetStatus.ProcessSchemaChangesOnOpen: return new BadRequest();\r\n case ChangeSetStatus.CannotMergeIntoReadonly: return new ValidationError();\r\n case ChangeSetStatus.CannotMergeIntoMaster: return new ValidationError();\r\n case ChangeSetStatus.CannotMergeIntoReversed: return new ValidationError();\r\n\r\n case RepositoryStatus.Success: return new Success();\r\n case RepositoryStatus.ServerUnavailable: return new NetworkError();\r\n case RepositoryStatus.LockAlreadyHeld: return new Conflict();\r\n case RepositoryStatus.SyncError: return new NetworkError();\r\n case RepositoryStatus.InvalidResponse: return new NetworkError();\r\n case RepositoryStatus.PendingTransactions: return new StateViolation();\r\n case RepositoryStatus.LockUsed: return new StateViolation();\r\n case RepositoryStatus.CannotCreateChangeSet: return new InternalError();\r\n case RepositoryStatus.InvalidRequest: return new NetworkError();\r\n case RepositoryStatus.ChangeSetRequired: return new StateViolation();\r\n case RepositoryStatus.CodeUnavailable: return new Conflict();\r\n case RepositoryStatus.CodeNotReserved: return new StateViolation();\r\n case RepositoryStatus.CodeUsed: return new StateViolation();\r\n case RepositoryStatus.LockNotHeld: return new Forbidden();\r\n case RepositoryStatus.RepositoryIsLocked: return new Locked();\r\n case RepositoryStatus.ChannelConstraintViolation: return new ConstraintViolation();\r\n\r\n case HttpStatus.Success: return new Success();\r\n\r\n case IModelHubStatus.Success: return new Success();\r\n case IModelHubStatus.Unknown: return new UnknownError();\r\n case IModelHubStatus.MissingRequiredProperties: return new ValidationError();\r\n case IModelHubStatus.InvalidPropertiesValues: return new ValidationError();\r\n case IModelHubStatus.UserDoesNotHavePermission: return new PermissionsViolation();\r\n case IModelHubStatus.UserDoesNotHaveAccess: return new PermissionsViolation();\r\n case IModelHubStatus.InvalidBriefcase: return new ValidationError();\r\n case IModelHubStatus.BriefcaseDoesNotExist: return new NotFound();\r\n case IModelHubStatus.BriefcaseDoesNotBelongToUser: return new PermissionsViolation();\r\n case IModelHubStatus.AnotherUserPushing: return new StateViolation();\r\n case IModelHubStatus.ChangeSetAlreadyExists: return new Conflict();\r\n case IModelHubStatus.ChangeSetDoesNotExist: return new NotFound();\r\n case IModelHubStatus.FileIsNotUploaded: return new StateViolation();\r\n case IModelHubStatus.iModelIsNotInitialized: return new StateViolation();\r\n case IModelHubStatus.ChangeSetPointsToBadSeed: return new InvalidData();\r\n case IModelHubStatus.OperationFailed: return new OperationFailed();\r\n case IModelHubStatus.PullIsRequired: return new StateViolation();\r\n case IModelHubStatus.MaximumNumberOfBriefcasesPerUser: return new Throttled();\r\n case IModelHubStatus.MaximumNumberOfBriefcasesPerUserPerMinute: return new Throttled();\r\n case IModelHubStatus.DatabaseTemporarilyLocked: return new Locked();\r\n case IModelHubStatus.iModelIsLocked: return new Locked();\r\n case IModelHubStatus.CodesExist: return new Conflict();\r\n case IModelHubStatus.LocksExist: return new Conflict();\r\n case IModelHubStatus.iModelAlreadyExists: return new Conflict();\r\n case IModelHubStatus.iModelDoesNotExist: return new NotFound();\r\n case IModelHubStatus.FileDoesNotExist: return new NotFound();\r\n case IModelHubStatus.FileAlreadyExists: return new Conflict();\r\n case IModelHubStatus.LockDoesNotExist: return new NotFound();\r\n case IModelHubStatus.LockOwnedByAnotherBriefcase: return new Conflict();\r\n case IModelHubStatus.CodeStateInvalid: return new StateViolation();\r\n case IModelHubStatus.CodeReservedByAnotherBriefcase: return new Conflict();\r\n case IModelHubStatus.CodeDoesNotExist: return new NotFound();\r\n case IModelHubStatus.EventTypeDoesNotExist: return new NotFound();\r\n case IModelHubStatus.EventSubscriptionDoesNotExist: return new NotFound();\r\n case IModelHubStatus.EventSubscriptionAlreadyExists: return new StateViolation();\r\n case IModelHubStatus.ITwinIdIsNotSpecified: return new ValidationError();\r\n case IModelHubStatus.FailedToGetITwinPermissions: return new OperationFailed();\r\n case IModelHubStatus.FailedToGetITwinMembers: return new OperationFailed();\r\n case IModelHubStatus.ChangeSetAlreadyHasVersion: return new Conflict();\r\n case IModelHubStatus.VersionAlreadyExists: return new Conflict();\r\n case IModelHubStatus.JobSchedulingFailed: return new InternalError();\r\n case IModelHubStatus.ConflictsAggregate: return new Conflict();\r\n case IModelHubStatus.FailedToGetITwinById: return new OperationFailed();\r\n case IModelHubStatus.DatabaseOperationFailed: return new OperationFailed();\r\n case IModelHubStatus.SeedFileInitializationFailed: return new OperationFailed();\r\n case IModelHubStatus.FailedToGetAssetPermissions: return new OperationFailed();\r\n case IModelHubStatus.FailedToGetAssetMembers: return new OperationFailed();\r\n case IModelHubStatus.ITwinDoesNotExist: return new NotFound();\r\n case IModelHubStatus.LockChunkDoesNotExist: return new NotFound();\r\n case IModelHubStatus.CheckpointAlreadyExists: return new Conflict();\r\n case IModelHubStatus.CheckpointDoesNotExist: return new NotFound();\r\n case IModelHubStatus.UndefinedArgumentError: return new ValidationError();\r\n case IModelHubStatus.InvalidArgumentError: return new ValidationError();\r\n case IModelHubStatus.MissingDownloadUrlError: return new ValidationError();\r\n case IModelHubStatus.NotSupportedInBrowser: return new NotSupported();\r\n case IModelHubStatus.FileHandlerNotSet: return new NotImplemented();\r\n case IModelHubStatus.FileNotFound: return new NotFound();\r\n case IModelHubStatus.InitializationTimeout: return new Timeout();\r\n\r\n case GeoServiceStatus.Success: return new Success();\r\n case GeoServiceStatus.NoGeoLocation: return new ValidationError();\r\n case GeoServiceStatus.OutOfUsefulRange: return new ValidationError();\r\n case GeoServiceStatus.OutOfMathematicalDomain: return new ValidationError();\r\n case GeoServiceStatus.NoDatumConverter: return new OperationFailed();\r\n case GeoServiceStatus.VerticalDatumConvertError: return new OperationFailed();\r\n case GeoServiceStatus.CSMapError: return new InternalError();\r\n case GeoServiceStatus.Pending: return new Pending(); // eslint-disable-line @typescript-eslint/no-deprecated\r\n\r\n case RealityDataStatus.Success: return new Success();\r\n case RealityDataStatus.InvalidData: return new InvalidData();\r\n\r\n default: return new UnknownError();\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"StatusCategory.js","sourceRoot":"","sources":["../../src/StatusCategory.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAWwB;AACxB,kEAA+D;AAO/D;;GAEG;AACH,MAAsB,cAAc;IAC3B,MAAM,CAAC,QAAQ,GAA+B,IAAI,GAAG,EAAE,CAAC;IAExD,MAAM,CAAC,GAAG,CAAC,KAAY;QAC5B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAI,KAAsB,CAAC,WAAsB,CAAC;QACnE,IAAI,OAAO,WAAW,KAAK,QAAQ;YACjC,OAAO,wBAAwB,CAAC,WAAW,CAAC,CAAC;QAE/C,OAAO,IAAI,YAAY,EAAE,CAAC;IAC5B,CAAC;;AAhBH,wCAqBC;AAED;;;GAGG;AACH,MAAsB,eAAgB,SAAQ,cAAc;IACnD,KAAK,GAAG,KAAK,CAAC;CACtB;AAFD,0CAEC;AAED;;;GAGG;AACH,MAAsB,aAAc,SAAQ,cAAc;IACjD,KAAK,GAAG,IAAI,CAAC;CACrB;AAFD,sCAEC;AAED,IAAU,IAAI,CAsBb;AAtBD,WAAU,IAAI;IACZ,MAAa,EAAG,SAAQ,eAAe;QAAU,IAAI,GAAG,IAAI,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArE,OAAE,KAAmE,CAAA;IAClF,MAAa,QAAS,SAAQ,eAAe;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjF,aAAQ,WAAyE,CAAA;IAC9F,MAAa,SAAU,SAAQ,eAAe;QAAU,IAAI,GAAG,WAAW,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnF,cAAS,YAA0E,CAAA;IAEhG,MAAa,UAAW,SAAQ,aAAa;QAAU,IAAI,GAAG,YAAY,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnF,eAAU,aAAyE,CAAA;IAChG,MAAa,YAAa,SAAQ,aAAa;QAAU,IAAI,GAAG,cAAc,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvF,iBAAY,eAA2E,CAAA;IACpG,MAAa,SAAU,SAAQ,aAAa;QAAU,IAAI,GAAG,WAAW,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjF,cAAS,YAAwE,CAAA;IAC9F,MAAa,QAAS,SAAQ,aAAa;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA/E,aAAQ,WAAuE,CAAA;IAC5F,MAAa,cAAe,SAAQ,aAAa;QAAU,IAAI,GAAG,gBAAgB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA3F,mBAAc,iBAA6E,CAAA;IACxG,MAAa,QAAS,SAAQ,aAAa;QAAU,IAAI,GAAG,UAAU,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA/E,aAAQ,WAAuE,CAAA;IAC5F,MAAa,IAAK,SAAQ,aAAa;QAAU,IAAI,GAAG,MAAM,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvE,SAAI,OAAmE,CAAA;IACpF,MAAa,kBAAmB,SAAQ,aAAa;QAAU,IAAI,GAAG,oBAAoB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnG,uBAAkB,qBAAiF,CAAA;IAChH,MAAa,iBAAkB,SAAQ,aAAa;QAAU,IAAI,GAAG,mBAAmB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAjG,sBAAiB,oBAAgF,CAAA;IAC9G,MAAa,kBAAmB,SAAQ,aAAa;QAAU,IAAI,GAAG,oBAAoB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAnG,uBAAkB,qBAAiF,CAAA;IAChH,MAAa,mBAAoB,SAAQ,aAAa;QAAU,IAAI,GAAG,qBAAqB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArG,wBAAmB,sBAAkF,CAAA;IAClH,MAAa,eAAgB,SAAQ,aAAa;QAAU,IAAI,GAAG,iBAAiB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA7F,oBAAe,kBAA8E,CAAA;IAC1G,MAAa,oBAAqB,SAAQ,aAAa;QAAU,IAAI,GAAG,sBAAsB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAAvG,yBAAoB,uBAAmF,CAAA;IACpH,MAAa,eAAgB,SAAQ,aAAa;QAAU,IAAI,GAAG,iBAAiB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA7F,oBAAe,kBAA8E,CAAA;IAE1G,MAAa,mBAAoB,SAAQ,aAAa;QAAU,IAAI,GAAG,qBAAqB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAArG,wBAAmB,sBAAkF,CAAA;IAClH,MAAa,cAAe,SAAQ,aAAa;QAAU,IAAI,GAAG,gBAAgB,CAAC;QAAQ,IAAI,GAAG,GAAG,CAAC;KAAE;IAA3F,mBAAc,iBAA6E,CAAA;AAC1G,CAAC,EAtBS,IAAI,KAAJ,IAAI,QAsBb;AAED,MAAM,OAAQ,SAAQ,IAAI,CAAC,EAAE;CAAI;AAEjC,MAAM,OAAQ,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAEvC,MAAM,SAAU,SAAQ,IAAI,CAAC,SAAS;CAAI;AAC1C,MAAM,WAAY,SAAQ,IAAI,CAAC,SAAS;CAAI;AAE5C,MAAM,UAAW,SAAQ,IAAI,CAAC,UAAU;CAAI;AAE5C,MAAM,SAAU,SAAQ,IAAI,CAAC,SAAS;CAAI;AAC1C,MAAM,oBAAqB,SAAQ,IAAI,CAAC,SAAS;CAAI;AACrD,MAAM,QAAS,SAAQ,IAAI,CAAC,SAAS;CAAI;AAEzC,MAAM,QAAS,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAExC,MAAM,UAAW,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACrD,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,eAAgB,SAAQ,IAAI,CAAC,UAAU;CAAI;AAEjD,MAAM,OAAQ,SAAQ,IAAI,CAAC,cAAc;CAAI;AAE7C,MAAM,QAAS,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAExC,MAAM,SAAU,SAAQ,IAAI,CAAC,IAAI;CAAI;AAErC,MAAM,mBAAoB,SAAQ,IAAI,CAAC,SAAS;CAAI;AACpD,MAAM,mBAAoB,SAAQ,IAAI,CAAC,SAAS;CAAI;AAEpD,MAAM,UAAW,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACrD,MAAM,WAAY,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACtD,MAAM,eAAgB,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAC1D,MAAM,cAAe,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEzD,MAAM,MAAO,SAAQ,IAAI,CAAC,QAAQ;CAAI;AAEtC,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,SAAU,SAAQ,IAAI,CAAC,eAAe;CAAI;AAEhD,MAAM,eAAgB,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAC1D,MAAM,aAAc,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AACxD,MAAM,YAAa,SAAQ,IAAI,CAAC,mBAAmB;CAAI;AAEvD,MAAM,cAAe,SAAQ,IAAI,CAAC,cAAc;CAAI;AAEpD,MAAM,OAAQ,SAAQ,IAAI,CAAC,UAAU;CAAI;AAEzC,SAAS,wBAAwB,CAAC,UAAkB;IAClD,QAAQ,UAAU,EAAE,CAAC;QACnB,KAAK,4BAAa,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACjD,KAAK,4BAAa,CAAC,KAAK,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAEpD,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAChD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,MAAM,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACzE,KAAK,2BAAY,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACzE,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACrD,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvD,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClD,KAAK,2BAAY,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACxD,KAAK,2BAAY,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACpE,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjE,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC1D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACjE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAClE,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3D,KAAK,2BAAY,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QACxE,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACtD,KAAK,2BAAY,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACpD,KAAK,2BAAY,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC7D,KAAK,2BAAY,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAChE,KAAK,2BAAY,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC/D,KAAK,2BAAY,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAEhD,KAAK,8BAAe,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC5D,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAE7E,KAAK,iCAAkB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACtD,KAAK,iCAAkB,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAE9E,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACnD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACxD,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,+BAA+B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC5E,KAAK,8BAAe,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAE3E,KAAK,mCAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACpD,KAAK,mCAAgB,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACnE,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,mCAAgB,CAAC,SAAS,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAC3D,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACjE,KAAK,mCAAgB,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACvE,KAAK,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC5D,KAAK,mCAAgB,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QACxE,KAAK,mCAAgB,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QAChE,KAAK,mCAAgB,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACrE,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,mCAAgB,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QAC5D,KAAK,mCAAgB,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,mCAAgB,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QAC9D,KAAK,mCAAgB,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,mBAAmB,EAAE,CAAC;QAEnF,KAAK,yBAAU,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAE9C,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACnD,KAAK,8BAAe,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACxD,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC7E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QAClF,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QAC9E,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,4BAA4B,CAAC,CAAC,OAAO,IAAI,oBAAoB,EAAE,CAAC;QACrF,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,wBAAwB,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,eAAe,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,gCAAgC,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QAC9E,KAAK,8BAAe,CAAC,yCAAyC,CAAC,CAAC,OAAO,IAAI,SAAS,EAAE,CAAC;QACvF,KAAK,8BAAe,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,cAAc,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,8BAAe,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvD,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAChE,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,8BAA8B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7D,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,6BAA6B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC1E,KAAK,8BAAe,CAAC,8BAA8B,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACjF,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACzE,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,0BAA0B,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACvE,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACjE,KAAK,8BAAe,CAAC,mBAAmB,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QACrE,KAAK,8BAAe,CAAC,kBAAkB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/D,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,4BAA4B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAChF,KAAK,8BAAe,CAAC,2BAA2B,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC/E,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC9D,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QAClE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACnE,KAAK,8BAAe,CAAC,sBAAsB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC1E,KAAK,8BAAe,CAAC,oBAAoB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACxE,KAAK,8BAAe,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC3E,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;QACtE,KAAK,8BAAe,CAAC,iBAAiB,CAAC,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;QACpE,KAAK,8BAAe,CAAC,YAAY,CAAC,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;QACzD,KAAK,8BAAe,CAAC,qBAAqB,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QAEjE,KAAK,+BAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACpD,KAAK,+BAAgB,CAAC,aAAa,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAClE,KAAK,+BAAgB,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,+BAAgB,CAAC,uBAAuB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC5E,KAAK,+BAAgB,CAAC,gBAAgB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QACrE,KAAK,+BAAgB,CAAC,yBAAyB,CAAC,CAAC,OAAO,IAAI,eAAe,EAAE,CAAC;QAC9E,KAAK,+BAAgB,CAAC,UAAU,CAAC,CAAC,OAAO,IAAI,aAAa,EAAE,CAAC;QAC7D,KAAK,+BAAgB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC,CAAC,uDAAuD;QAE5G,KAAK,gCAAiB,CAAC,OAAO,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE,CAAC;QACrD,KAAK,gCAAiB,CAAC,WAAW,CAAC,CAAC,OAAO,IAAI,WAAW,EAAE,CAAC;QAE7D,OAAO,CAAC,CAAC,OAAO,IAAI,YAAY,EAAE,CAAC;IACrC,CAAC;AACH,CAAC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module Errors\n /\n\nimport {\n BentleyError,\n BentleyStatus,\n BriefcaseStatus,\n ChangeSetStatus,\n GeoServiceStatus,\n HttpStatus,\n IModelHubStatus,\n IModelStatus,\n RealityDataStatus,\n RpcInterfaceStatus,\n} from \"./BentleyError\";\nimport { RepositoryStatus } from \"./internal/RepositoryStatus\";\n\n/ eslint-disable @typescript-eslint/no-shadow /\n\n/* @alpha /\nexport type StatusCategoryHandler = (error: Error) => StatusCategory \| undefined;\n\n/* A group of related statuses for aggregate reporting purposes.\n * @alpha\n /\nexport abstract class StatusCategory {\n public static handlers: Set<StatusCategoryHandler> = new Set();\n\n public static for(error: Error): StatusCategory {\n for (const handler of this.handlers) {\n const category = handler(error);\n if (category) {\n return category;\n }\n }\n\n const errorNumber = (error as BentleyError).errorNumber as unknown;\n if (typeof errorNumber === \"number\")\n return lookupHttpStatusCategory(errorNumber);\n\n return new UnknownError();\n }\n\n public abstract name: string;\n public abstract code: number;\n public abstract error: boolean;\n}\n\n/*\n A success status.\n * @alpha\n /\nexport abstract class SuccessCategory extends StatusCategory {\n public error = false;\n}\n\n/\n An error status.\n * @alpha\n */\nexport abstract class ErrorCategory extends StatusCategory {\n public error = true;\n}\n\nnamespace HTTP {\n export class OK extends SuccessCategory { public name = \"OK\"; public code = 200; }\n export class Accepted extends SuccessCategory { public name = \"Accepted\"; public code = 202; }\n export class NoContent extends SuccessCategory { public name = \"NoContent\"; public code = 204; }\n\n export class BadRequest extends ErrorCategory { public name = \"BadRequest\"; public code = 400; }\n export class Unauthorized extends ErrorCategory { public name = \"Unauthorized\"; public code = 401; }\n export class Forbidden extends ErrorCategory { public name = \"Forbidden\"; public code = 403; }\n export class NotFound extends ErrorCategory { public name = \"NotFound\"; public code = 404; }\n export class RequestTimeout extends ErrorCategory { public name = \"RequestTimeout\"; public code = 408; }\n export class Conflict extends ErrorCategory { public name = \"Conflict\"; public code = 409; }\n export class Gone extends ErrorCategory { public name = \"Gone\"; public code = 410; }\n export class PreconditionFailed extends ErrorCategory { public name = \"PreconditionFailed\"; public code = 412; }\n export class ExpectationFailed extends ErrorCategory { public name = \"ExpectationFailed\"; public code = 417; }\n export class MisdirectedRequest extends ErrorCategory { public name = \"MisdirectedRequest\"; public code = 421; }\n export class UnprocessableEntity extends ErrorCategory { public name = \"UnprocessableEntity\"; public code = 422; }\n export class UpgradeRequired extends ErrorCategory { public name = \"UpgradeRequired\"; public code = 426; }\n export class PreconditionRequired extends ErrorCategory { public name = \"PreconditionRequired\"; public code = 428; }\n export class TooManyRequests extends ErrorCategory { public name = \"TooManyRequests\"; public code = 429; }\n\n export class InternalServerError extends ErrorCategory { public name = \"InternalServerError\"; public code = 500; }\n export class NotImplemented extends ErrorCategory { public name = \"NotImplemented\"; public code = 501; }\n}\n\nclass Success extends HTTP.OK { }\n\nclass Pending extends HTTP.Accepted { }\n\nclass NoContent extends HTTP.NoContent { }\nclass NothingToDo extends HTTP.NoContent { }\n\nclass BadRequest extends HTTP.BadRequest { }\n\nclass Forbidden extends HTTP.Forbidden { }\nclass PermissionsViolation extends HTTP.Forbidden { }\nclass ReadOnly extends HTTP.Forbidden { }\n\nclass NotFound extends HTTP.NotFound { }\n\nclass NotEnabled extends HTTP.UnprocessableEntity { }\nclass NotSupported extends HTTP.UnprocessableEntity { }\n\nclass ValidationError extends HTTP.BadRequest { }\n\nclass Timeout extends HTTP.RequestTimeout { }\n\nclass Conflict extends HTTP.Conflict { }\n\nclass Cancelled extends HTTP.Gone { }\n\nclass ConstraintViolation extends HTTP.Forbidden { }\nclass VersioningViolation extends HTTP.Forbidden { }\n\nclass Corruption extends HTTP.InternalServerError { }\nclass InvalidData extends HTTP.InternalServerError { }\nclass OperationFailed extends HTTP.InternalServerError { }\nclass StateViolation extends HTTP.InternalServerError { }\n\nclass Locked extends HTTP.Conflict { }\n\nclass NetworkError extends HTTP.InternalServerError { }\n\nclass Throttled extends HTTP.TooManyRequests { }\n\nclass FileSystemError extends HTTP.InternalServerError { }\nclass InternalError extends HTTP.InternalServerError { }\nclass UnknownError extends HTTP.InternalServerError { }\n\nclass NotImplemented extends HTTP.NotImplemented { }\n\nclass Aborted extends HTTP.BadRequest { }\n\nfunction lookupHttpStatusCategory(statusCode: number): StatusCategory {\n switch (statusCode) {\n case BentleyStatus.SUCCESS: return new Success();\n case BentleyStatus.ERROR: return new UnknownError();\n\n case IModelStatus.Success: return new Success();\n case IModelStatus.AlreadyLoaded: return new StateViolation();\n case IModelStatus.AlreadyOpen: return new StateViolation();\n case IModelStatus.BadArg: return new ValidationError();\n case IModelStatus.BadElement: return new ValidationError();\n case IModelStatus.BadModel: return new ValidationError();\n case IModelStatus.BadRequest: return new BadRequest();\n case IModelStatus.BadSchema: return new ValidationError();\n case IModelStatus.CannotUndo: return new OperationFailed();\n case IModelStatus.CodeNotReserved: return new StateViolation();\n case IModelStatus.DeletionProhibited: return new Forbidden();\n case IModelStatus.DuplicateCode: return new Conflict();\n case IModelStatus.DuplicateName: return new Conflict();\n case IModelStatus.ElementBlockedChange: return new ConstraintViolation();\n case IModelStatus.FileAlreadyExists: return new Conflict();\n case IModelStatus.FileNotFound: return new NotFound();\n case IModelStatus.FileNotLoaded: return new FileSystemError();\n case IModelStatus.ForeignKeyConstraint: return new ConstraintViolation();\n case IModelStatus.IdExists: return new Conflict();\n case IModelStatus.InDynamicTransaction: return new StateViolation();\n case IModelStatus.InvalidCategory: return new ValidationError();\n case IModelStatus.InvalidCode: return new ValidationError();\n case IModelStatus.InvalidCodeSpec: return new ValidationError();\n case IModelStatus.InvalidId: return new ValidationError();\n case IModelStatus.InvalidName: return new ValidationError();\n case IModelStatus.InvalidParent: return new Conflict();\n case IModelStatus.InvalidProfileVersion: return new InvalidData();\n case IModelStatus.IsCreatingChangeSet: return new StateViolation();\n case IModelStatus.LockNotHeld: return new Forbidden();\n case IModelStatus.Mismatch2d3d: return new ValidationError();\n case IModelStatus.MismatchGcs: return new ValidationError();\n case IModelStatus.MissingDomain: return new ValidationError();\n case IModelStatus.MissingHandler: return new ValidationError();\n case IModelStatus.MissingId: return new ValidationError();\n case IModelStatus.NoGeometry: return new NoContent();\n case IModelStatus.NoMultiTxnOperation: return new StateViolation();\n case IModelStatus.NotEnabled: return new NotEnabled();\n case IModelStatus.NotFound: return new NotFound();\n case IModelStatus.NotOpen: return new StateViolation();\n case IModelStatus.NotOpenForWrite: return new Forbidden();\n case IModelStatus.NotSameUnitBase: return new ValidationError();\n case IModelStatus.NothingToRedo: return new NothingToDo();\n case IModelStatus.NothingToUndo: return new NothingToDo();\n case IModelStatus.ParentBlockedChange: return new Forbidden();\n case IModelStatus.ReadError: return new FileSystemError();\n case IModelStatus.ReadOnly: return new ReadOnly();\n case IModelStatus.ReadOnlyDomain: return new ReadOnly();\n case IModelStatus.RepositoryManagerError: return new NetworkError();\n case IModelStatus.SQLiteError: return new InternalError();\n case IModelStatus.TransactionActive: return new StateViolation();\n case IModelStatus.UnitsMissing: return new ValidationError();\n case IModelStatus.UnknownFormat: return new InvalidData();\n case IModelStatus.UpgradeFailed: return new OperationFailed();\n case IModelStatus.ValidationFailed: return new ValidationError();\n case IModelStatus.VersionTooNew: return new VersioningViolation();\n case IModelStatus.VersionTooOld: return new VersioningViolation();\n case IModelStatus.ViewNotFound: return new NotFound();\n case IModelStatus.WriteError: return new FileSystemError();\n case IModelStatus.WrongClass: return new ValidationError();\n case IModelStatus.WrongIModel: return new ValidationError();\n case IModelStatus.WrongDomain: return new ValidationError();\n case IModelStatus.WrongElement: return new ValidationError();\n case IModelStatus.WrongHandler: return new ValidationError();\n case IModelStatus.WrongModel: return new ValidationError();\n case IModelStatus.ConstraintNotUnique: return new ConstraintViolation();\n case IModelStatus.NoGeoLocation: return new ValidationError();\n case IModelStatus.ServerTimeout: return new Timeout();\n case IModelStatus.NoContent: return new NoContent();\n case IModelStatus.NotRegistered: return new NotImplemented();\n case IModelStatus.FunctionNotFound: return new NotImplemented();\n case IModelStatus.NoActiveCommand: return new StateViolation();\n case IModelStatus.Aborted: return new Aborted();\n\n case BriefcaseStatus.CannotAcquire: return new OperationFailed();\n case BriefcaseStatus.CannotDownload: return new OperationFailed();\n case BriefcaseStatus.CannotUpload: return new OperationFailed();\n case BriefcaseStatus.CannotCopy: return new OperationFailed();\n case BriefcaseStatus.CannotDelete: return new OperationFailed();\n case BriefcaseStatus.VersionNotFound: return new NotFound();\n case BriefcaseStatus.CannotApplyChanges: return new OperationFailed();\n case BriefcaseStatus.DownloadCancelled: return new Cancelled();\n case BriefcaseStatus.ContainsDeletedChangeSets: return new ValidationError();\n\n case RpcInterfaceStatus.Success: return new Success();\n case RpcInterfaceStatus.IncompatibleVersion: return new VersioningViolation();\n\n case ChangeSetStatus.Success: return new Success();\n case ChangeSetStatus.ApplyError: return new OperationFailed();\n case ChangeSetStatus.ChangeTrackingNotEnabled: return new NotEnabled();\n case ChangeSetStatus.CorruptedChangeStream: return new Corruption();\n case ChangeSetStatus.FileNotFound: return new NotFound();\n case ChangeSetStatus.FileWriteError: return new FileSystemError();\n case ChangeSetStatus.HasLocalChanges: return new StateViolation();\n case ChangeSetStatus.HasUncommittedChanges: return new StateViolation();\n case ChangeSetStatus.InvalidId: return new Corruption();\n case ChangeSetStatus.InvalidVersion: return new Corruption();\n case ChangeSetStatus.InDynamicTransaction: return new StateViolation();\n case ChangeSetStatus.IsCreatingChangeSet: return new StateViolation();\n case ChangeSetStatus.IsNotCreatingChangeSet: return new StateViolation();\n case ChangeSetStatus.MergePropagationError: return new OperationFailed();\n case ChangeSetStatus.NothingToMerge: return new NothingToDo();\n case ChangeSetStatus.NoTransactions: return new OperationFailed();\n case ChangeSetStatus.ParentMismatch: return new ValidationError();\n case ChangeSetStatus.SQLiteError: return new InternalError();\n case ChangeSetStatus.WrongDgnDb: return new ValidationError();\n case ChangeSetStatus.CouldNotOpenDgnDb: return new OperationFailed();\n case ChangeSetStatus.MergeSchemaChangesOnOpen: return new BadRequest();\n case ChangeSetStatus.ReverseOrReinstateSchemaChanges: return new Conflict();\n case ChangeSetStatus.ProcessSchemaChangesOnOpen: return new BadRequest();\n case ChangeSetStatus.CannotMergeIntoReadonly: return new ValidationError();\n case ChangeSetStatus.CannotMergeIntoMaster: return new ValidationError();\n case ChangeSetStatus.CannotMergeIntoReversed: return new ValidationError();\n\n case RepositoryStatus.Success: return new Success();\n case RepositoryStatus.ServerUnavailable: return new NetworkError();\n case RepositoryStatus.LockAlreadyHeld: return new Conflict();\n case RepositoryStatus.SyncError: return new NetworkError();\n case RepositoryStatus.InvalidResponse: return new NetworkError();\n case RepositoryStatus.PendingTransactions: return new StateViolation();\n case RepositoryStatus.LockUsed: return new StateViolation();\n case RepositoryStatus.CannotCreateChangeSet: return new InternalError();\n case RepositoryStatus.InvalidRequest: return new NetworkError();\n case RepositoryStatus.ChangeSetRequired: return new StateViolation();\n case RepositoryStatus.CodeUnavailable: return new Conflict();\n case RepositoryStatus.CodeNotReserved: return new StateViolation();\n case RepositoryStatus.CodeUsed: return new StateViolation();\n case RepositoryStatus.LockNotHeld: return new Forbidden();\n case RepositoryStatus.RepositoryIsLocked: return new Locked();\n case RepositoryStatus.ChannelConstraintViolation: return new ConstraintViolation();\n\n case HttpStatus.Success: return new Success();\n\n case IModelHubStatus.Success: return new Success();\n case IModelHubStatus.Unknown: return new UnknownError();\n case IModelHubStatus.MissingRequiredProperties: return new ValidationError();\n case IModelHubStatus.InvalidPropertiesValues: return new ValidationError();\n case IModelHubStatus.UserDoesNotHavePermission: return new PermissionsViolation();\n case IModelHubStatus.UserDoesNotHaveAccess: return new PermissionsViolation();\n case IModelHubStatus.InvalidBriefcase: return new ValidationError();\n case IModelHubStatus.BriefcaseDoesNotExist: return new NotFound();\n case IModelHubStatus.BriefcaseDoesNotBelongToUser: return new PermissionsViolation();\n case IModelHubStatus.AnotherUserPushing: return new StateViolation();\n case IModelHubStatus.ChangeSetAlreadyExists: return new Conflict();\n case IModelHubStatus.ChangeSetDoesNotExist: return new NotFound();\n case IModelHubStatus.FileIsNotUploaded: return new StateViolation();\n case IModelHubStatus.iModelIsNotInitialized: return new StateViolation();\n case IModelHubStatus.ChangeSetPointsToBadSeed: return new InvalidData();\n case IModelHubStatus.OperationFailed: return new OperationFailed();\n case IModelHubStatus.PullIsRequired: return new StateViolation();\n case IModelHubStatus.MaximumNumberOfBriefcasesPerUser: return new Throttled();\n case IModelHubStatus.MaximumNumberOfBriefcasesPerUserPerMinute: return new Throttled();\n case IModelHubStatus.DatabaseTemporarilyLocked: return new Locked();\n case IModelHubStatus.iModelIsLocked: return new Locked();\n case IModelHubStatus.CodesExist: return new Conflict();\n case IModelHubStatus.LocksExist: return new Conflict();\n case IModelHubStatus.iModelAlreadyExists: return new Conflict();\n case IModelHubStatus.iModelDoesNotExist: return new NotFound();\n case IModelHubStatus.FileDoesNotExist: return new NotFound();\n case IModelHubStatus.FileAlreadyExists: return new Conflict();\n case IModelHubStatus.LockDoesNotExist: return new NotFound();\n case IModelHubStatus.LockOwnedByAnotherBriefcase: return new Conflict();\n case IModelHubStatus.CodeStateInvalid: return new StateViolation();\n case IModelHubStatus.CodeReservedByAnotherBriefcase: return new Conflict();\n case IModelHubStatus.CodeDoesNotExist: return new NotFound();\n case IModelHubStatus.EventTypeDoesNotExist: return new NotFound();\n case IModelHubStatus.EventSubscriptionDoesNotExist: return new NotFound();\n case IModelHubStatus.EventSubscriptionAlreadyExists: return new StateViolation();\n case IModelHubStatus.ITwinIdIsNotSpecified: return new ValidationError();\n case IModelHubStatus.FailedToGetITwinPermissions: return new OperationFailed();\n case IModelHubStatus.FailedToGetITwinMembers: return new OperationFailed();\n case IModelHubStatus.ChangeSetAlreadyHasVersion: return new Conflict();\n case IModelHubStatus.VersionAlreadyExists: return new Conflict();\n case IModelHubStatus.JobSchedulingFailed: return new InternalError();\n case IModelHubStatus.ConflictsAggregate: return new Conflict();\n case IModelHubStatus.FailedToGetITwinById: return new OperationFailed();\n case IModelHubStatus.DatabaseOperationFailed: return new OperationFailed();\n case IModelHubStatus.SeedFileInitializationFailed: return new OperationFailed();\n case IModelHubStatus.FailedToGetAssetPermissions: return new OperationFailed();\n case IModelHubStatus.FailedToGetAssetMembers: return new OperationFailed();\n case IModelHubStatus.ITwinDoesNotExist: return new NotFound();\n case IModelHubStatus.LockChunkDoesNotExist: return new NotFound();\n case IModelHubStatus.CheckpointAlreadyExists: return new Conflict();\n case IModelHubStatus.CheckpointDoesNotExist: return new NotFound();\n case IModelHubStatus.UndefinedArgumentError: return new ValidationError();\n case IModelHubStatus.InvalidArgumentError: return new ValidationError();\n case IModelHubStatus.MissingDownloadUrlError: return new ValidationError();\n case IModelHubStatus.NotSupportedInBrowser: return new NotSupported();\n case IModelHubStatus.FileHandlerNotSet: return new NotImplemented();\n case IModelHubStatus.FileNotFound: return new NotFound();\n case IModelHubStatus.InitializationTimeout: return new Timeout();\n\n case GeoServiceStatus.Success: return new Success();\n case GeoServiceStatus.NoGeoLocation: return new ValidationError();\n case GeoServiceStatus.OutOfUsefulRange: return new ValidationError();\n case GeoServiceStatus.OutOfMathematicalDomain: return new ValidationError();\n case GeoServiceStatus.NoDatumConverter: return new OperationFailed();\n case GeoServiceStatus.VerticalDatumConvertError: return new OperationFailed();\n case GeoServiceStatus.CSMapError: return new InternalError();\n case GeoServiceStatus.Pending: return new Pending(); // eslint-disable-line @typescript-eslint/no-deprecated\n\n case RealityDataStatus.Success: return new Success();\n case RealityDataStatus.InvalidData: return new InvalidData();\n\n default: return new UnknownError();\n }\n}\n"]}

package/lib/cjs/StringUtils.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../src/StringUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AASH,oCAGC;AAQD,4DAEC;AApBD;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,IAAgB;IAC3C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,wBAAwB,CAAC,MAAc;IACrD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Utils\r\n /\r\n\r\n/* Given an array of bytes containing a utf-8 string, convert to a string.\r\n * @param utf8: An array of utf-8 characters as a byte array\r\n * @returns An equivalent string, or undefined if the array does not contain a valid utf-8 string.\r\n * @note This function uses Javascript's TextDecoder if supported by the browser; otherwise, it\r\n * falls back to a less efficient polyfill.\r\n * @public\r\n /\r\nexport function utf8ToString(utf8: Uint8Array): string \| undefined {\r\n const decoder = new TextDecoder(\"utf-8\");\r\n return decoder.decode(utf8);\r\n}\r\n\r\n/* Given a base-64-encoded string, decode it into an array of bytes.\r\n * @param base64 The base-64-encoded string.\r\n * @returns the decoded byte array.\r\n * @throws DOMException if the length of the input string is not a multiple of 4.\r\n * @public\r\n */\r\nexport function base64StringToUint8Array(base64: string): Uint8Array {\r\n return new Uint8Array(atob(base64).split(\"\").map((c) => c.charCodeAt(0)));\r\n}\r\n"]}
1	+ {"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../src/StringUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AASH,oCAGC;AAQD,4DAEC;AApBD;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,IAAgB;IAC3C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,wBAAwB,CAAC,MAAc;IACrD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module Utils\n /\n\n/* Given an array of bytes containing a utf-8 string, convert to a string.\n * @param utf8: An array of utf-8 characters as a byte array\n * @returns An equivalent string, or undefined if the array does not contain a valid utf-8 string.\n * @note This function uses Javascript's TextDecoder if supported by the browser; otherwise, it\n * falls back to a less efficient polyfill.\n * @public\n /\nexport function utf8ToString(utf8: Uint8Array): string \| undefined {\n const decoder = new TextDecoder(\"utf-8\");\n return decoder.decode(utf8);\n}\n\n/* Given a base-64-encoded string, decode it into an array of bytes.\n * @param base64 The base-64-encoded string.\n * @returns the decoded byte array.\n * @throws DOMException if the length of the input string is not a multiple of 4.\n * @public\n */\nexport function base64StringToUint8Array(base64: string): Uint8Array {\n return new Uint8Array(atob(base64).split(\"\").map((c) => c.charCodeAt(0)));\n}\n"]}

package/lib/cjs/Time.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Time.js","sourceRoot":"","sources":["../../src/Time.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;GAGG;AACH,MAAa,UAAU;IACJ,aAAa,CAAS;IACvC,YAAoB,eAAuB,CAAC,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEpF,mCAAmC;IACnC,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAW,OAAO,KAAK,OAAO,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,WAAW,CAAC,OAAe,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrF;;OAEG;IACI,MAAM,CAAC,gBAAgB,CAAC,YAAoB,IAAI,OAAO,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC7F,qDAAqD;IACrD,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,8DAA8D;IAC9D,IAAW,eAAe,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,4DAA4D;IAC5D,IAAW,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,8EAA8E;IACvE,KAAK,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAChH,sEAAsE;IAC/D,IAAI,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAE/G;;;OAGG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAU;QACjC,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAI,EAAU,EAAE,OAAuB;QAC7D,IAAI,OAAY,CAAC;QACjB,MAAM,WAAW,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAChD,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACvD,IAAI,OAAO;gBACT,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QACf,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,YAAY,CAAI,EAAyB,EAAE,KAAW,EAAE,GAAG,IAAW;QACjF,OAAO,IAAI,OAAO,CAAI,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAChH,CAAC;CACF;AAnED,gCAmEC;AAED;;;;GAIG;AACH,MAAa,WAAW;IACL,aAAa,CAAS;IACvC,gGAAgG;IAChG,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,YAAoB,YAAoB,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEhF,2CAA2C;IACpC,MAAM,CAAC,GAAG,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE3D;;OAEG;IACI,MAAM,CAAC,OAAO,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEjG;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEnG,uHAAuH;IACvH,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE5E,mIAAmI;IACnI,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE1E;;OAEG;IACI,MAAM,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE/F;;OAEG;IACI,KAAK,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE9F;;OAEG;IACI,KAAK,CAAC,QAAoB,IAAiB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEvH;;OAEG;IACI,IAAI,CAAC,QAAoB,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CAC1G;AA5CD,kCA4CC;AAED;;GAEG;AACH,MAAa,SAAS;IAeD;IAdX,MAAM,CAAe;IACrB,KAAK,CAAe;IAC5B,6DAA6D;IAC7D,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,0EAA0E;IAC1E,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,qFAAqF;IACrF,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpM,mFAAmF;IACnF,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE;;;OAGG;IACH,YAAmB,WAAoB,EAAE,gBAAgB,GAAG,KAAK;QAA9C,gBAAW,GAAX,WAAW,CAAS;QACrC,IAAI,gBAAgB;YAClB,IAAI,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC;IAED,yFAAyF;IAClF,KAAK;QACV,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAClC,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,0BAA0B;IACnB,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;CAC/D;AAlCD,8BAkCC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Utils\r\n /\r\n\r\n/* A duration of time. Can be either positive (towards future) or negative (in the past).\r\n * BeDurations are immutable.\r\n * @public\r\n /\r\nexport class BeDuration {\r\n private readonly _milliseconds: number;\r\n private constructor(milliseconds: number = 0) { this._milliseconds = milliseconds; }\r\n\r\n /* The duration in milliseconds /\r\n public get milliseconds() { return this._milliseconds; }\r\n public get seconds() { return this._milliseconds / 1000; }\r\n\r\n /* Create a BeDuration from seconds.\r\n * @param seconds the number of seconds for this BeDuration\r\n /\r\n public static fromSeconds(seconds: number) { return new BeDuration(seconds 1000); }\r\n /** Create a BeDuration from milliseconds.\r\n * @param milliseconds the number of milliseconds for this BeDuration\r\n /\r\n public static fromMilliseconds(milliseconds: number) { return new BeDuration(milliseconds); }\r\n /* Determine whether this BeDuration is 0 seconds /\r\n public get isZero() { return this._milliseconds === 0; }\r\n /* Determine whether this BeDuration is towards the future /\r\n public get isTowardsFuture(): boolean { return this._milliseconds > 0; }\r\n /* Determine whether this BeDuration is towards the past /\r\n public get isTowardsPast(): boolean { return this._milliseconds < 0; }\r\n /* Subtract a BeDuration from this BeDuration, returning a new BeDuration. /\r\n public minus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds - other._milliseconds); }\r\n /* Add a BeDuration to this BeDuration, returning a new BeDuration /\r\n public plus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds + other._milliseconds); }\r\n\r\n /* Utility function to just wait for the specified time\r\n * @param ms Duration in milliseconds to wait\r\n * @return Promise that resolves after the specified wait period\r\n /\r\n public static async wait(ms: number): Promise<void> {\r\n return new Promise<void>((resolve: any) => setTimeout(resolve, ms));\r\n }\r\n\r\n /* Utility function to wait for either the specified time or a promise, whichever resolves first\r\n * @param ms Maximum duration in milliseconds to wait\r\n * @param promise A pending promise to wait for\r\n * @return Promise that resolves after the specified wait period or the provided promise resolves, whichever comes first\r\n /\r\n public static async race<T>(ms: number, promise: PromiseLike<T>): Promise<T \| void> {\r\n let timeout: any;\r\n const waitPromise = new Promise<void>((resolve) => {\r\n timeout = setTimeout(resolve, ms);\r\n });\r\n return Promise.race([waitPromise, promise]).finally(() => {\r\n if (timeout)\r\n clearTimeout(timeout);\r\n });\r\n }\r\n\r\n /* Utility function to just wait for the specified time\r\n * @return Promise that resolves after the specified wait period\r\n /\r\n public async wait(): Promise<void> {\r\n return new Promise<void>((resolve: any) => setTimeout(resolve, this._milliseconds));\r\n }\r\n\r\n /* Execute a function after delaying by this duration.\r\n * @param fn the function to execute after the delay\r\n * @param scope An optional object scope to serve as the 'this' pointer when `fn` is invoked.\r\n * @param args optional arguments to `fn`\r\n * @return Promise resolved by `fn`\r\n /\r\n public async executeAfter<T>(fn: (...args: any[]) => T, scope?: any, ...args: any[]): Promise<T> {\r\n return new Promise<T>((resolve: any) => setTimeout(() => resolve(fn.apply(scope, args)), this._milliseconds));\r\n }\r\n}\r\n\r\n/* A specific point in time relative to the current time.\r\n * BeTimePoints are used for timing operations. They are created from a BeDuration relative to the \"now\".\r\n * BeTimePoints are immutable.\r\n * @public\r\n /\r\nexport class BeTimePoint {\r\n private readonly _milliseconds: number;\r\n /* the time in milliseconds, of this BeTimePoint (relative to January 1, 1970 00:00:00 UTC.) /\r\n public get milliseconds() { return this._milliseconds; }\r\n private constructor(milliseconds: number) { this._milliseconds = milliseconds; }\r\n\r\n /* Create a BeTimePoint from Date.now() /\r\n public static now() { return new BeTimePoint(Date.now()); }\r\n\r\n /* Create a BeTimePoint at a specified duration in the future from now\r\n * @param val the duration from now\r\n /\r\n public static fromNow(val: BeDuration) { return new BeTimePoint(Date.now() + val.milliseconds); }\r\n\r\n /* Create a BeTimePoint at a specified duration in the past before now\r\n * @param val the duration before now\r\n /\r\n public static beforeNow(val: BeDuration) { return new BeTimePoint(Date.now() - val.milliseconds); }\r\n\r\n /* Determine whether this BeTimePoint is a time in the future from the time this method is called (it calls now()!) /\r\n public get isInFuture(): boolean { return Date.now() < this._milliseconds; }\r\n\r\n /* Determine whether this BeTimePoint is a time that has already passed before the time this method is called (it calls now()!) /\r\n public get isInPast(): boolean { return Date.now() > this._milliseconds; }\r\n\r\n /* Determine whether this BeTimePoint happens before another one.\r\n * @param other the other BeTimePoint.\r\n /\r\n public before(other: BeTimePoint): boolean { return this._milliseconds < other._milliseconds; }\r\n\r\n /* Determine whether this BeTimePoint happens after another one.\r\n * @param other the other BeTimePoint.\r\n /\r\n public after(other: BeTimePoint): boolean { return this._milliseconds > other._milliseconds; }\r\n\r\n /* Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\r\n * @param duration the duration to subtract.\r\n /\r\n public minus(duration: BeDuration): BeTimePoint { return new BeTimePoint(this._milliseconds - duration.milliseconds); }\r\n\r\n /* Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\r\n * @param duration the duration to subtract.\r\n /\r\n public plus(duration: BeDuration) { return new BeTimePoint(this._milliseconds + duration.milliseconds); }\r\n}\r\n\r\n/* A StopWatch for timing operations.\r\n * @public\r\n /\r\nexport class StopWatch {\r\n private _start?: BeTimePoint;\r\n private _stop?: BeTimePoint;\r\n /* Get the elapsed time since start() on a running timer. /\r\n public get current(): BeDuration { return BeDuration.fromMilliseconds(BeTimePoint.now().milliseconds - (!!this._start ? this._start.milliseconds : 0)); }\r\n /* Get the elapsed time, in seconds, since start() on a running timer. /\r\n public get currentSeconds(): number { return this.current.seconds; }\r\n /* Get the elapsed time between start() and stop() on this timer in milliseconds. /\r\n public get elapsed(): BeDuration { return BeDuration.fromMilliseconds((!!this._stop ? this._stop.milliseconds : BeTimePoint.now().milliseconds) - (!!this._start ? this._start.milliseconds : 0)); }\r\n /* Get the elapsed time, in seconds, between start() and stop() on this timer. /\r\n public get elapsedSeconds(): number { return this.elapsed.seconds; }\r\n /* ctor for StopWatch\r\n * @param description optional string stored with the StopWatch\r\n * @param startImmediately if true, StopWatch is started when created. Otherwise, call start() explicitly.\r\n /\r\n constructor(public description?: string, startImmediately = false) {\r\n if (startImmediately)\r\n this.start();\r\n }\r\n\r\n /* Start the stopwatch. Any future time measurements will be based on this new value. /\r\n public start(): void {\r\n this.reset();\r\n this._start = BeTimePoint.now();\r\n }\r\n\r\n /* Stop the stopwatch so that the duration can be viewed later. /\r\n public stop(): BeDuration {\r\n this._stop = BeTimePoint.now();\r\n return this.elapsed;\r\n }\r\n\r\n /* Clear the StopWatch */\r\n public reset(): void { this._start = this._stop = undefined; }\r\n}\r\n"]}
1	+ {"version":3,"file":"Time.js","sourceRoot":"","sources":["../../src/Time.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;GAGG;AACH,MAAa,UAAU;IACJ,aAAa,CAAS;IACvC,YAAoB,eAAuB,CAAC,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEpF,mCAAmC;IACnC,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAW,OAAO,KAAK,OAAO,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,WAAW,CAAC,OAAe,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrF;;OAEG;IACI,MAAM,CAAC,gBAAgB,CAAC,YAAoB,IAAI,OAAO,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC7F,qDAAqD;IACrD,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,8DAA8D;IAC9D,IAAW,eAAe,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,4DAA4D;IAC5D,IAAW,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,8EAA8E;IACvE,KAAK,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAChH,sEAAsE;IAC/D,IAAI,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAE/G;;;OAGG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAU;QACjC,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAI,EAAU,EAAE,OAAuB;QAC7D,IAAI,OAAY,CAAC;QACjB,MAAM,WAAW,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAChD,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACvD,IAAI,OAAO;gBACT,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QACf,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,YAAY,CAAI,EAAyB,EAAE,KAAW,EAAE,GAAG,IAAW;QACjF,OAAO,IAAI,OAAO,CAAI,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAChH,CAAC;CACF;AAnED,gCAmEC;AAED;;;;GAIG;AACH,MAAa,WAAW;IACL,aAAa,CAAS;IACvC,gGAAgG;IAChG,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,YAAoB,YAAoB,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEhF,2CAA2C;IACpC,MAAM,CAAC,GAAG,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE3D;;OAEG;IACI,MAAM,CAAC,OAAO,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEjG;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEnG,uHAAuH;IACvH,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE5E,mIAAmI;IACnI,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE1E;;OAEG;IACI,MAAM,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE/F;;OAEG;IACI,KAAK,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE9F;;OAEG;IACI,KAAK,CAAC,QAAoB,IAAiB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEvH;;OAEG;IACI,IAAI,CAAC,QAAoB,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CAC1G;AA5CD,kCA4CC;AAED;;GAEG;AACH,MAAa,SAAS;IAeD;IAdX,MAAM,CAAe;IACrB,KAAK,CAAe;IAC5B,6DAA6D;IAC7D,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,0EAA0E;IAC1E,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,qFAAqF;IACrF,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpM,mFAAmF;IACnF,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE;;;OAGG;IACH,YAAmB,WAAoB,EAAE,gBAAgB,GAAG,KAAK;QAA9C,gBAAW,GAAX,WAAW,CAAS;QACrC,IAAI,gBAAgB;YAClB,IAAI,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC;IAED,yFAAyF;IAClF,KAAK;QACV,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAClC,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,0BAA0B;IACnB,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;CAC/D;AAlCD,8BAkCC","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 Utils\n /\n\n/* A duration of time. Can be either positive (towards future) or negative (in the past).\n * BeDurations are immutable.\n * @public\n /\nexport class BeDuration {\n private readonly _milliseconds: number;\n private constructor(milliseconds: number = 0) { this._milliseconds = milliseconds; }\n\n /* The duration in milliseconds /\n public get milliseconds() { return this._milliseconds; }\n public get seconds() { return this._milliseconds / 1000; }\n\n /* Create a BeDuration from seconds.\n * @param seconds the number of seconds for this BeDuration\n /\n public static fromSeconds(seconds: number) { return new BeDuration(seconds 1000); }\n /** Create a BeDuration from milliseconds.\n * @param milliseconds the number of milliseconds for this BeDuration\n /\n public static fromMilliseconds(milliseconds: number) { return new BeDuration(milliseconds); }\n /* Determine whether this BeDuration is 0 seconds /\n public get isZero() { return this._milliseconds === 0; }\n /* Determine whether this BeDuration is towards the future /\n public get isTowardsFuture(): boolean { return this._milliseconds > 0; }\n /* Determine whether this BeDuration is towards the past /\n public get isTowardsPast(): boolean { return this._milliseconds < 0; }\n /* Subtract a BeDuration from this BeDuration, returning a new BeDuration. /\n public minus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds - other._milliseconds); }\n /* Add a BeDuration to this BeDuration, returning a new BeDuration /\n public plus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds + other._milliseconds); }\n\n /* Utility function to just wait for the specified time\n * @param ms Duration in milliseconds to wait\n * @return Promise that resolves after the specified wait period\n /\n public static async wait(ms: number): Promise<void> {\n return new Promise<void>((resolve: any) => setTimeout(resolve, ms));\n }\n\n /* Utility function to wait for either the specified time or a promise, whichever resolves first\n * @param ms Maximum duration in milliseconds to wait\n * @param promise A pending promise to wait for\n * @return Promise that resolves after the specified wait period or the provided promise resolves, whichever comes first\n /\n public static async race<T>(ms: number, promise: PromiseLike<T>): Promise<T \| void> {\n let timeout: any;\n const waitPromise = new Promise<void>((resolve) => {\n timeout = setTimeout(resolve, ms);\n });\n return Promise.race([waitPromise, promise]).finally(() => {\n if (timeout)\n clearTimeout(timeout);\n });\n }\n\n /* Utility function to just wait for the specified time\n * @return Promise that resolves after the specified wait period\n /\n public async wait(): Promise<void> {\n return new Promise<void>((resolve: any) => setTimeout(resolve, this._milliseconds));\n }\n\n /* Execute a function after delaying by this duration.\n * @param fn the function to execute after the delay\n * @param scope An optional object scope to serve as the 'this' pointer when `fn` is invoked.\n * @param args optional arguments to `fn`\n * @return Promise resolved by `fn`\n /\n public async executeAfter<T>(fn: (...args: any[]) => T, scope?: any, ...args: any[]): Promise<T> {\n return new Promise<T>((resolve: any) => setTimeout(() => resolve(fn.apply(scope, args)), this._milliseconds));\n }\n}\n\n/* A specific point in time relative to the current time.\n * BeTimePoints are used for timing operations. They are created from a BeDuration relative to the \"now\".\n * BeTimePoints are immutable.\n * @public\n /\nexport class BeTimePoint {\n private readonly _milliseconds: number;\n /* the time in milliseconds, of this BeTimePoint (relative to January 1, 1970 00:00:00 UTC.) /\n public get milliseconds() { return this._milliseconds; }\n private constructor(milliseconds: number) { this._milliseconds = milliseconds; }\n\n /* Create a BeTimePoint from Date.now() /\n public static now() { return new BeTimePoint(Date.now()); }\n\n /* Create a BeTimePoint at a specified duration in the future from now\n * @param val the duration from now\n /\n public static fromNow(val: BeDuration) { return new BeTimePoint(Date.now() + val.milliseconds); }\n\n /* Create a BeTimePoint at a specified duration in the past before now\n * @param val the duration before now\n /\n public static beforeNow(val: BeDuration) { return new BeTimePoint(Date.now() - val.milliseconds); }\n\n /* Determine whether this BeTimePoint is a time in the future from the time this method is called (it calls now()!) /\n public get isInFuture(): boolean { return Date.now() < this._milliseconds; }\n\n /* Determine whether this BeTimePoint is a time that has already passed before the time this method is called (it calls now()!) /\n public get isInPast(): boolean { return Date.now() > this._milliseconds; }\n\n /* Determine whether this BeTimePoint happens before another one.\n * @param other the other BeTimePoint.\n /\n public before(other: BeTimePoint): boolean { return this._milliseconds < other._milliseconds; }\n\n /* Determine whether this BeTimePoint happens after another one.\n * @param other the other BeTimePoint.\n /\n public after(other: BeTimePoint): boolean { return this._milliseconds > other._milliseconds; }\n\n /* Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\n * @param duration the duration to subtract.\n /\n public minus(duration: BeDuration): BeTimePoint { return new BeTimePoint(this._milliseconds - duration.milliseconds); }\n\n /* Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\n * @param duration the duration to subtract.\n /\n public plus(duration: BeDuration) { return new BeTimePoint(this._milliseconds + duration.milliseconds); }\n}\n\n/* A StopWatch for timing operations.\n * @public\n /\nexport class StopWatch {\n private _start?: BeTimePoint;\n private _stop?: BeTimePoint;\n /* Get the elapsed time since start() on a running timer. /\n public get current(): BeDuration { return BeDuration.fromMilliseconds(BeTimePoint.now().milliseconds - (!!this._start ? this._start.milliseconds : 0)); }\n /* Get the elapsed time, in seconds, since start() on a running timer. /\n public get currentSeconds(): number { return this.current.seconds; }\n /* Get the elapsed time between start() and stop() on this timer in milliseconds. /\n public get elapsed(): BeDuration { return BeDuration.fromMilliseconds((!!this._stop ? this._stop.milliseconds : BeTimePoint.now().milliseconds) - (!!this._start ? this._start.milliseconds : 0)); }\n /* Get the elapsed time, in seconds, between start() and stop() on this timer. /\n public get elapsedSeconds(): number { return this.elapsed.seconds; }\n /* ctor for StopWatch\n * @param description optional string stored with the StopWatch\n * @param startImmediately if true, StopWatch is started when created. Otherwise, call start() explicitly.\n /\n constructor(public description?: string, startImmediately = false) {\n if (startImmediately)\n this.start();\n }\n\n /* Start the stopwatch. Any future time measurements will be based on this new value. /\n public start(): void {\n this.reset();\n this._start = BeTimePoint.now();\n }\n\n /* Stop the stopwatch so that the duration can be viewed later. /\n public stop(): BeDuration {\n this._stop = BeTimePoint.now();\n return this.elapsed;\n }\n\n /* Clear the StopWatch */\n public reset(): void { this._start = this._stop = undefined; }\n}\n"]}

package/lib/cjs/Tracing.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Tracing.js","sourceRoot":"","sources":["../../src/Tracing.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,qCAAyD;AAEzD,kGAAkG;AAClG;;;;GAIG;AACH,IAAY,QAMX;AAND,WAAY,QAAQ;IAClB,+CAAY,CAAA;IACZ,2CAAU,CAAA;IACV,2CAAU,CAAA;IACV,+CAAY,CAAA;IACZ,+CAAY,CAAA;AACd,CAAC,EANW,QAAQ,wBAAR,QAAQ,QAMnB;AAED,SAAS,gBAAgB,CAAC,GAAY;IACpC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,SAAS,CAAC;AACxF,CAAC;AAED,6GAA6G;AAC7G,iJAAiJ;AACjJ,SAAS,qBAAqB,CAAC,GAAY;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QACrB,OAAO,KAAK,CAAC;IAEf,IAAI,QAAQ,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI;YAC/B,SAAS;QAEX,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,QAAQ,GAAG,OAAO,CAAC,CAAC;YACpB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,OAAO,CAAC,KAAK,QAAQ;YACvB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,SAAS,CAAC;AACpG,CAAC;AAED,QAAQ,CAAC,CAAC,cAAc,CAAC,GAAY,EAAE,IAAI,GAAG,EAAE;IAC9C,IAAI,qBAAqB,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAClB,OAAO;IACT,CAAC;IAED,oEAAoE;IACpE,sGAAsG;IACtG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,OAAO;IACT,CAAC;IAED,8DAA8D;IAC9D,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QACtB,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO;QAC9B,KAAK,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,aAAa,CAAC,GAAW;IAChC,OAAO,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,wFAAwF;AAExF;;;;GAIG;AACH,MAAa,OAAO;IACV,MAAM,CAAC,OAAO,CAAU;IACxB,MAAM,CAAC,cAAc,CAAqH;IAElJ;;;;;;;OAOG;IACI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAI,IAAY,EAAE,EAAoB,EAAE,OAAqB,EAAE,aAA2B;QACpH,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS;YACvE,OAAO,EAAE,EAAE,CAAC;QAEd,kGAAkG;QAClG,MAAM,MAAM,GAAG,aAAa,KAAK,SAAS;YACxC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE;YACzC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,aAAa,CAAC,CAAC;QAExG,OAAO,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CACxC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAClC,MAAM,EACN,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAClF,EACD,KAAK,IAAI,EAAE;YACT,IAAI,CAAC;gBACH,OAAO,MAAM,EAAE,EAAE,CAAC;YACpB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,GAAG,YAAY,KAAK,EAAE,sDAAsD;oBAC9E,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9G,MAAM,GAAG,CAAC;YACZ,CAAC;oBAAS,CAAC;gBACT,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;YACxF,CAAC;QACH,CAAC,CACF,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,CAAQ;QACpC,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IACrG,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAc,EAAE,GAAkC;QAClF,OAAO,CAAC,OAAO,GAAG,MAAM,CAAC;QACzB,OAAO,CAAC,cAAc,GAAG,GAAG,CAAC;QAC7B,eAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,KAAK,EAAE,eAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QACvG,eAAM,CAAC,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,IAAI,EAAE,eAAM,CAAC,OAAO,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QACpG,eAAM,CAAC,UAAU,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,OAAO,EAAE,eAAM,CAAC,UAAU,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QAC7G,eAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,KAAK,EAAE,eAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;IACzG,CAAC;IAEO,MAAM,CAAC,iBAAiB,CAAC,KAAe,EAAE,IAAiB,EAAE,UAAmB,KAAK;QAC3F,OAAO,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE;YACrC,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;YAC7D,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;gBACnE,OAAO,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YAE3C,MAAM,kBAAkB,GAAG,eAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACxD,IAAI,eAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC;oBACH,OAAO,CAAC,cAAc,EAAE,KAAK;yBAC1B,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;wBACjD,EAAE,QAAQ,CAAC,OAAO,EAAE;wBAClB,GAAG,aAAa,CAAC,kBAAkB,CAAC;wBACpC,KAAK,EAAE,OAAO;wBACd,cAAc,EAAE,QAAQ;qBACzB,CAAC,CAAC;gBACP,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC,mHAAmH;gBAE/H,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,CAAC;gBACrF,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE;oBACtB,GAAG,kBAAkB;oBACrB,yDAAyD;oBACzD,QAAQ,EAAE,WAAW,EAAE,OAAO;oBAC9B,OAAO,EAAE,WAAW,EAAE,MAAM;oBAC5B,WAAW,EAAE,WAAW,EAAE,UAAU;oBACpC,wDAAwD;iBACzD,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,aAAa,CAAC,UAA0B;QACpD,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;IAC5G,CAAC;CACF;AAnGD,0BAmGC;AAED,oDAAoD","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Logging\r\n /\r\n\r\nimport type { ContextAPI, SpanAttributes, SpanAttributeValue, SpanContext, SpanOptions, TraceAPI, Tracer } from \"@opentelemetry/api\";\r\nimport { LogFunction, Logger, LogLevel } from \"./Logger\";\r\n\r\n// re-export so that consumers can construct full SpanOptions object without external dependencies\r\n/\r\n Mirrors the SpanKind enum from [@opentelemetry/api](https://open-telemetry.github.io/opentelemetry-js/enums/_opentelemetry_api.SpanKind.html)\r\n * @public\r\n * @deprecated in 4.4 - will not be removed until after 2026-06-13. OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.\r\n /\r\nexport enum SpanKind {\r\n INTERNAL = 0,\r\n SERVER = 1,\r\n CLIENT = 2,\r\n PRODUCER = 3,\r\n CONSUMER = 4\r\n}\r\n\r\nfunction isValidPrimitive(val: unknown): val is SpanAttributeValue {\r\n return typeof val === \"string\" \|\| typeof val === \"number\" \|\| typeof val === \"boolean\";\r\n}\r\n\r\n// Only _homogenous_ arrays of strings, numbers, or booleans are supported as OpenTelemetry Attribute values.\r\n// Per the spec (https://opentelemetry.io/docs/reference/specification/common/common/#attribute), empty arrays and null values are supported too.\r\nfunction isValidPrimitiveArray(val: unknown): val is SpanAttributeValue {\r\n if (!Array.isArray(val))\r\n return false;\r\n\r\n let itemType;\r\n for (const x of val) {\r\n if (x === undefined \|\| x === null)\r\n continue;\r\n\r\n if (!itemType) {\r\n itemType = typeof x;\r\n if (!isValidPrimitive(x))\r\n return false;\r\n }\r\n\r\n if (typeof x !== itemType)\r\n return false;\r\n }\r\n return true;\r\n}\r\n\r\nfunction isPlainObject(obj: unknown): obj is object {\r\n return typeof obj === \"object\" && obj !== null && Object.getPrototypeOf(obj) === Object.prototype;\r\n}\r\n\r\nfunction getFlatEntries(obj: unknown, path = \"\"): Iterable<[string, SpanAttributeValue]> {\r\n if (isValidPrimitiveArray(obj)) {\r\n yield [path, obj];\r\n return;\r\n }\r\n\r\n // Prefer JSON serialization over flattening for any non-POJO types.\r\n // There's just too many ways trying to flatten those can go wrong (Dates, Buffers, TypedArrays, etc.)\r\n if (!isPlainObject(obj) && !Array.isArray(obj)) {\r\n yield [path, isValidPrimitive(obj) ? obj : JSON.stringify(obj)];\r\n return;\r\n }\r\n\r\n // Always serialize empty objects/arrays as empty array values\r\n const entries = Object.entries(obj);\r\n if (entries.length === 0)\r\n yield [path, []];\r\n\r\n for (const [key, val] of entries)\r\n yield* getFlatEntries(val, (path === \"\") ? key : `${path}.${key}`);\r\n}\r\n\r\nfunction flattenObject(obj: object): SpanAttributes {\r\n return Object.fromEntries(getFlatEntries(obj));\r\n}\r\n\r\n/* eslint-disable @typescript-eslint/no-deprecated -- lots of self-references here... /\r\n\r\n/\r\n Enables OpenTelemetry tracing in addition to traditional logging.\r\n * @public\r\n * @deprecated in 4.4 - will not be removed until after 2026-06-13. OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.\r\n /\r\nexport class Tracing {\r\n private static _tracer?: Tracer;\r\n private static _openTelemetry?: { trace: Pick<TraceAPI, \"setSpan\" \| \"setSpanContext\" \| \"getSpan\">, context: Pick<ContextAPI, \"active\" \| \"with\"> };\r\n\r\n /\r\n If OpenTelemetry tracing is enabled, creates a new span and runs the provided function in it.\r\n * If OpenTelemetry tracing is _not_ enabled, runs the provided function.\r\n * @param name name of the new span\r\n * @param fn function to run inside the new span\r\n * @param options span options\r\n * @param parentContext optional context used to retrieve parent span id\r\n /\r\n public static async withSpan<T>(name: string, fn: () => Promise<T>, options?: SpanOptions, parentContext?: SpanContext): Promise<T> {\r\n if (Tracing._tracer === undefined \|\| Tracing._openTelemetry === undefined)\r\n return fn();\r\n\r\n // this case is for context propagation - parentContext is typically constructed from HTTP headers\r\n const parent = parentContext === undefined\r\n ? Tracing._openTelemetry.context.active()\r\n : Tracing._openTelemetry.trace.setSpanContext(Tracing._openTelemetry.context.active(), parentContext);\r\n\r\n return Tracing._openTelemetry.context.with(\r\n Tracing._openTelemetry.trace.setSpan(\r\n parent,\r\n Tracing._tracer.startSpan(name, options, Tracing._openTelemetry.context.active()),\r\n ),\r\n async () => {\r\n try {\r\n return await fn();\r\n } catch (err) {\r\n if (err instanceof Error) // ignore non-Error throws, such as RpcControlResponse\r\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttribute(\"error\", true);\r\n throw err;\r\n } finally {\r\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.end();\r\n }\r\n },\r\n );\r\n }\r\n\r\n /\r\n Adds a span event describing a runtime exception, as advised in OpenTelemetry documentation\r\n * @param e error (exception) object\r\n /\r\n public static recordException(e: Error) {\r\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.recordException(e);\r\n }\r\n\r\n /\r\n Enable logging to OpenTelemetry. [[Tracing.withSpan]] will be enabled, all log entries will be attached to active span as span events.\r\n * [IModelHost.startup]($backend) will call this automatically if the `enableOpenTelemetry` option is enabled and it succeeds in requiring `@opentelemetry/api`.\r\n * @note Node.js OpenTelemetry SDK should be initialized by the user.\r\n /\r\n public static enableOpenTelemetry(tracer: Tracer, api: typeof Tracing._openTelemetry) {\r\n Tracing._tracer = tracer;\r\n Tracing._openTelemetry = api;\r\n Logger.logTrace = Tracing.withOpenTelemetry(LogLevel.Trace, Logger.logTrace.bind(Logger)).bind(Logger);\r\n Logger.logInfo = Tracing.withOpenTelemetry(LogLevel.Info, Logger.logInfo.bind(Logger)).bind(Logger);\r\n Logger.logWarning = Tracing.withOpenTelemetry(LogLevel.Warning, Logger.logWarning.bind(Logger)).bind(Logger);\r\n Logger.logError = Tracing.withOpenTelemetry(LogLevel.Error, Logger.logError.bind(Logger)).bind(Logger);\r\n }\r\n\r\n private static withOpenTelemetry(level: LogLevel, base: LogFunction, isError: boolean = false): LogFunction {\r\n return (category, message, metaData) => {\r\n const oTelContext = Tracing._openTelemetry?.context.active();\r\n if (Tracing._openTelemetry === undefined \|\| oTelContext === undefined)\r\n return base(category, message, metaData);\r\n\r\n const serializedMetadata = Logger.getMetaData(metaData);\r\n if (Logger.isEnabled(category, level)) {\r\n try {\r\n Tracing._openTelemetry?.trace\r\n .getSpan(Tracing._openTelemetry.context.active())\r\n ?.addEvent(message, {\r\n ...flattenObject(serializedMetadata),\r\n error: isError,\r\n loggerCategory: category,\r\n });\r\n } catch { } // avoid throwing random errors (with stack trace mangled by async hooks) when openTelemetry collector doesn't work\r\n\r\n const spanContext = Tracing._openTelemetry.trace.getSpan(oTelContext)?.spanContext();\r\n base(category, message, {\r\n ...serializedMetadata,\r\n / eslint-disable @typescript-eslint/naming-convention /\r\n trace_id: spanContext?.traceId,\r\n span_id: spanContext?.spanId,\r\n trace_flags: spanContext?.traceFlags,\r\n / eslint-enable @typescript-eslint/naming-convention /\r\n });\r\n }\r\n };\r\n }\r\n\r\n /* Set attributes on currently active openTelemetry span. Doesn't do anything if openTelemetry logging is not initialized.\r\n * @param attributes The attributes to set\r\n /\r\n public static setAttributes(attributes: SpanAttributes) {\r\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttributes(attributes);\r\n }\r\n}\r\n\r\n/ eslint-enable @typescript-eslint/no-deprecated */\r\n"]}
1	+ {"version":3,"file":"Tracing.js","sourceRoot":"","sources":["../../src/Tracing.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,qCAAyD;AAEzD,kGAAkG;AAClG;;;;GAIG;AACH,IAAY,QAMX;AAND,WAAY,QAAQ;IAClB,+CAAY,CAAA;IACZ,2CAAU,CAAA;IACV,2CAAU,CAAA;IACV,+CAAY,CAAA;IACZ,+CAAY,CAAA;AACd,CAAC,EANW,QAAQ,wBAAR,QAAQ,QAMnB;AAED,SAAS,gBAAgB,CAAC,GAAY;IACpC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,SAAS,CAAC;AACxF,CAAC;AAED,6GAA6G;AAC7G,iJAAiJ;AACjJ,SAAS,qBAAqB,CAAC,GAAY;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QACrB,OAAO,KAAK,CAAC;IAEf,IAAI,QAAQ,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI;YAC/B,SAAS;QAEX,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,QAAQ,GAAG,OAAO,CAAC,CAAC;YACpB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,OAAO,CAAC,KAAK,QAAQ;YACvB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,SAAS,CAAC;AACpG,CAAC;AAED,QAAQ,CAAC,CAAC,cAAc,CAAC,GAAY,EAAE,IAAI,GAAG,EAAE;IAC9C,IAAI,qBAAqB,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAClB,OAAO;IACT,CAAC;IAED,oEAAoE;IACpE,sGAAsG;IACtG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,OAAO;IACT,CAAC;IAED,8DAA8D;IAC9D,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QACtB,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO;QAC9B,KAAK,CAAC,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,aAAa,CAAC,GAAW;IAChC,OAAO,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,wFAAwF;AAExF;;;;GAIG;AACH,MAAa,OAAO;IACV,MAAM,CAAC,OAAO,CAAU;IACxB,MAAM,CAAC,cAAc,CAAqH;IAElJ;;;;;;;OAOG;IACI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAI,IAAY,EAAE,EAAoB,EAAE,OAAqB,EAAE,aAA2B;QACpH,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS;YACvE,OAAO,EAAE,EAAE,CAAC;QAEd,kGAAkG;QAClG,MAAM,MAAM,GAAG,aAAa,KAAK,SAAS;YACxC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE;YACzC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,aAAa,CAAC,CAAC;QAExG,OAAO,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CACxC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAClC,MAAM,EACN,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAClF,EACD,KAAK,IAAI,EAAE;YACT,IAAI,CAAC;gBACH,OAAO,MAAM,EAAE,EAAE,CAAC;YACpB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,GAAG,YAAY,KAAK,EAAE,sDAAsD;oBAC9E,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9G,MAAM,GAAG,CAAC;YACZ,CAAC;oBAAS,CAAC;gBACT,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;YACxF,CAAC;QACH,CAAC,CACF,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,CAAQ;QACpC,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IACrG,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAc,EAAE,GAAkC;QAClF,OAAO,CAAC,OAAO,GAAG,MAAM,CAAC;QACzB,OAAO,CAAC,cAAc,GAAG,GAAG,CAAC;QAC7B,eAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,KAAK,EAAE,eAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QACvG,eAAM,CAAC,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,IAAI,EAAE,eAAM,CAAC,OAAO,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QACpG,eAAM,CAAC,UAAU,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,OAAO,EAAE,eAAM,CAAC,UAAU,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;QAC7G,eAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,iBAAiB,CAAC,iBAAQ,CAAC,KAAK,EAAE,eAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC,CAAC,IAAI,CAAC,eAAM,CAAC,CAAC;IACzG,CAAC;IAEO,MAAM,CAAC,iBAAiB,CAAC,KAAe,EAAE,IAAiB,EAAE,UAAmB,KAAK;QAC3F,OAAO,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE;YACrC,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;YAC7D,IAAI,OAAO,CAAC,cAAc,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;gBACnE,OAAO,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YAE3C,MAAM,kBAAkB,GAAG,eAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACxD,IAAI,eAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC;oBACH,OAAO,CAAC,cAAc,EAAE,KAAK;yBAC1B,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;wBACjD,EAAE,QAAQ,CAAC,OAAO,EAAE;wBAClB,GAAG,aAAa,CAAC,kBAAkB,CAAC;wBACpC,KAAK,EAAE,OAAO;wBACd,cAAc,EAAE,QAAQ;qBACzB,CAAC,CAAC;gBACP,CAAC;gBAAC,MAAM,CAAC,CAAC,CAAC,CAAC,mHAAmH;gBAE/H,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,CAAC;gBACrF,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE;oBACtB,GAAG,kBAAkB;oBACrB,yDAAyD;oBACzD,QAAQ,EAAE,WAAW,EAAE,OAAO;oBAC9B,OAAO,EAAE,WAAW,EAAE,MAAM;oBAC5B,WAAW,EAAE,WAAW,EAAE,UAAU;oBACpC,wDAAwD;iBACzD,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,aAAa,CAAC,UAA0B;QACpD,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;IAC5G,CAAC;CACF;AAnGD,0BAmGC;AAED,oDAAoD","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 Logging\n /\n\nimport type { ContextAPI, SpanAttributes, SpanAttributeValue, SpanContext, SpanOptions, TraceAPI, Tracer } from \"@opentelemetry/api\";\nimport { LogFunction, Logger, LogLevel } from \"./Logger\";\n\n// re-export so that consumers can construct full SpanOptions object without external dependencies\n/\n Mirrors the SpanKind enum from [@opentelemetry/api](https://open-telemetry.github.io/opentelemetry-js/enums/_opentelemetry_api.SpanKind.html)\n * @public\n * @deprecated in 4.4 - will not be removed until after 2026-06-13. OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.\n /\nexport enum SpanKind {\n INTERNAL = 0,\n SERVER = 1,\n CLIENT = 2,\n PRODUCER = 3,\n CONSUMER = 4\n}\n\nfunction isValidPrimitive(val: unknown): val is SpanAttributeValue {\n return typeof val === \"string\" \|\| typeof val === \"number\" \|\| typeof val === \"boolean\";\n}\n\n// Only _homogenous_ arrays of strings, numbers, or booleans are supported as OpenTelemetry Attribute values.\n// Per the spec (https://opentelemetry.io/docs/reference/specification/common/common/#attribute), empty arrays and null values are supported too.\nfunction isValidPrimitiveArray(val: unknown): val is SpanAttributeValue {\n if (!Array.isArray(val))\n return false;\n\n let itemType;\n for (const x of val) {\n if (x === undefined \|\| x === null)\n continue;\n\n if (!itemType) {\n itemType = typeof x;\n if (!isValidPrimitive(x))\n return false;\n }\n\n if (typeof x !== itemType)\n return false;\n }\n return true;\n}\n\nfunction isPlainObject(obj: unknown): obj is object {\n return typeof obj === \"object\" && obj !== null && Object.getPrototypeOf(obj) === Object.prototype;\n}\n\nfunction getFlatEntries(obj: unknown, path = \"\"): Iterable<[string, SpanAttributeValue]> {\n if (isValidPrimitiveArray(obj)) {\n yield [path, obj];\n return;\n }\n\n // Prefer JSON serialization over flattening for any non-POJO types.\n // There's just too many ways trying to flatten those can go wrong (Dates, Buffers, TypedArrays, etc.)\n if (!isPlainObject(obj) && !Array.isArray(obj)) {\n yield [path, isValidPrimitive(obj) ? obj : JSON.stringify(obj)];\n return;\n }\n\n // Always serialize empty objects/arrays as empty array values\n const entries = Object.entries(obj);\n if (entries.length === 0)\n yield [path, []];\n\n for (const [key, val] of entries)\n yield* getFlatEntries(val, (path === \"\") ? key : `${path}.${key}`);\n}\n\nfunction flattenObject(obj: object): SpanAttributes {\n return Object.fromEntries(getFlatEntries(obj));\n}\n\n/* eslint-disable @typescript-eslint/no-deprecated -- lots of self-references here... /\n\n/\n Enables OpenTelemetry tracing in addition to traditional logging.\n * @public\n * @deprecated in 4.4 - will not be removed until after 2026-06-13. OpenTelemetry Tracing helpers will become internal in a future release. Apps should use `@opentelemetry/api` directly.\n /\nexport class Tracing {\n private static _tracer?: Tracer;\n private static _openTelemetry?: { trace: Pick<TraceAPI, \"setSpan\" \| \"setSpanContext\" \| \"getSpan\">, context: Pick<ContextAPI, \"active\" \| \"with\"> };\n\n /\n If OpenTelemetry tracing is enabled, creates a new span and runs the provided function in it.\n * If OpenTelemetry tracing is _not_ enabled, runs the provided function.\n * @param name name of the new span\n * @param fn function to run inside the new span\n * @param options span options\n * @param parentContext optional context used to retrieve parent span id\n /\n public static async withSpan<T>(name: string, fn: () => Promise<T>, options?: SpanOptions, parentContext?: SpanContext): Promise<T> {\n if (Tracing._tracer === undefined \|\| Tracing._openTelemetry === undefined)\n return fn();\n\n // this case is for context propagation - parentContext is typically constructed from HTTP headers\n const parent = parentContext === undefined\n ? Tracing._openTelemetry.context.active()\n : Tracing._openTelemetry.trace.setSpanContext(Tracing._openTelemetry.context.active(), parentContext);\n\n return Tracing._openTelemetry.context.with(\n Tracing._openTelemetry.trace.setSpan(\n parent,\n Tracing._tracer.startSpan(name, options, Tracing._openTelemetry.context.active()),\n ),\n async () => {\n try {\n return await fn();\n } catch (err) {\n if (err instanceof Error) // ignore non-Error throws, such as RpcControlResponse\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttribute(\"error\", true);\n throw err;\n } finally {\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.end();\n }\n },\n );\n }\n\n /\n Adds a span event describing a runtime exception, as advised in OpenTelemetry documentation\n * @param e error (exception) object\n /\n public static recordException(e: Error) {\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.recordException(e);\n }\n\n /\n Enable logging to OpenTelemetry. [[Tracing.withSpan]] will be enabled, all log entries will be attached to active span as span events.\n * [IModelHost.startup]($backend) will call this automatically if the `enableOpenTelemetry` option is enabled and it succeeds in requiring `@opentelemetry/api`.\n * @note Node.js OpenTelemetry SDK should be initialized by the user.\n /\n public static enableOpenTelemetry(tracer: Tracer, api: typeof Tracing._openTelemetry) {\n Tracing._tracer = tracer;\n Tracing._openTelemetry = api;\n Logger.logTrace = Tracing.withOpenTelemetry(LogLevel.Trace, Logger.logTrace.bind(Logger)).bind(Logger);\n Logger.logInfo = Tracing.withOpenTelemetry(LogLevel.Info, Logger.logInfo.bind(Logger)).bind(Logger);\n Logger.logWarning = Tracing.withOpenTelemetry(LogLevel.Warning, Logger.logWarning.bind(Logger)).bind(Logger);\n Logger.logError = Tracing.withOpenTelemetry(LogLevel.Error, Logger.logError.bind(Logger)).bind(Logger);\n }\n\n private static withOpenTelemetry(level: LogLevel, base: LogFunction, isError: boolean = false): LogFunction {\n return (category, message, metaData) => {\n const oTelContext = Tracing._openTelemetry?.context.active();\n if (Tracing._openTelemetry === undefined \|\| oTelContext === undefined)\n return base(category, message, metaData);\n\n const serializedMetadata = Logger.getMetaData(metaData);\n if (Logger.isEnabled(category, level)) {\n try {\n Tracing._openTelemetry?.trace\n .getSpan(Tracing._openTelemetry.context.active())\n ?.addEvent(message, {\n ...flattenObject(serializedMetadata),\n error: isError,\n loggerCategory: category,\n });\n } catch { } // avoid throwing random errors (with stack trace mangled by async hooks) when openTelemetry collector doesn't work\n\n const spanContext = Tracing._openTelemetry.trace.getSpan(oTelContext)?.spanContext();\n base(category, message, {\n ...serializedMetadata,\n / eslint-disable @typescript-eslint/naming-convention /\n trace_id: spanContext?.traceId,\n span_id: spanContext?.spanId,\n trace_flags: spanContext?.traceFlags,\n / eslint-enable @typescript-eslint/naming-convention /\n });\n }\n };\n }\n\n /* Set attributes on currently active openTelemetry span. Doesn't do anything if openTelemetry logging is not initialized.\n * @param attributes The attributes to set\n /\n public static setAttributes(attributes: SpanAttributes) {\n Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttributes(attributes);\n }\n}\n\n/ eslint-enable @typescript-eslint/no-deprecated */\n"]}

package/lib/cjs/TupleKeyedMap.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"TupleKeyedMap.js","sourceRoot":"","sources":["../../src/TupleKeyedMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,aAAa;IAChB,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,oCAAoC;IACpC,YAAmB,OAA6C;QAC9D,IAAI,OAAO;YACT,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,CAAC;IACL,CAAC;IAEM,KAAK;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAEO,YAAY;QAClB,OAAO,KAAK,CACV,kEAAkE,CACnE,CAAC;IACJ,CAAC;IAEM,GAAG,CAAC,GAAM;QACf,IAAI,MAAM,GAAsB,IAAI,CAAC,IAAI,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,MAAM,YAAY,GAAG,CAAC;gBAC1B,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;YAC5B,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,MAAM,YAAY,GAAG;YACvB,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACrC,CAAC;IAEM,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,MAAM,GAAkB,IAAI,CAAC,IAAI,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC,MAAM,YAAY,GAAG,CAAC;YAC1B,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,QAAS,CAAC,CAAA,IAAI,CAAC,GAAkB,EAAE,SAAyB;YAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;oBACrB,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,OAAmB,EAAE,CAAC,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAEO,KAAK,GAAW,CAAC,CAAC;IAC1B,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAW,CAAC,MAAM,CAAC,WAAW,CAAC;QAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IAC/B,CAAC;CACF;AAhFD,sCAgFC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Collections\r\n /\r\n\r\n/* A map similar to the standard JavaScript Map collection except that the keys must be a tuple\r\n * (javascript array), and two keys are considered equal if their elements in order are strict-equal,\r\n * and the tuples have the same amount of elements\r\n \r\n This means you can use array literals to key data in Maps that would otherwise be reference-compared\r\n * if using JavaScript's built in Map\r\n \r\n Note that JavaScript's Map type, unlike this one that uses strict equality, uses instead\r\n * SameValueZero equality comparison\r\n * @see https://262.ecma-international.org/6.0/#sec-samevaluezero\r\n \r\n ```js\r\n * const map = new TupleKeyedMap([[1,\"y\"], \"value\"]);\r\n * const value = map.get([1, \"y\"]); // a normal map would identify these keys as different because they are independent objects\r\n * ```\r\n \r\n It is implemented by each index of the tuple key being used as a singular key into a submap\r\n * @note this only implements a subset of the Map interface\r\n * @public\r\n /\r\nexport class TupleKeyedMap<K extends readonly any[], V> {\r\n private _map = new Map<K[0], Map<any, V> \| V>();\r\n\r\n // argument types match those of Map\r\n public constructor(entries?: readonly (readonly [K, V])[] \| null) {\r\n if (entries)\r\n for (const [k, v] of entries) {\r\n this.set(k, v);\r\n }\r\n }\r\n\r\n public clear(): void {\r\n return this._map.clear();\r\n }\r\n\r\n private makeKeyError() {\r\n return Error(\r\n \"A Bad key was used, it didn't match the key type of the the map.\",\r\n );\r\n }\r\n\r\n public get(key: K): V \| undefined {\r\n let cursor: Map<any, any> \| V = this._map;\r\n for (const subkey of key) {\r\n if (!(cursor instanceof Map))\r\n throw this.makeKeyError();\r\n cursor = cursor.get(subkey);\r\n if (cursor === undefined)\r\n return undefined;\r\n }\r\n if (cursor instanceof Map)\r\n throw this.makeKeyError();\r\n return cursor;\r\n }\r\n\r\n public has(key: K): boolean {\r\n return this.get(key) !== undefined;\r\n }\r\n\r\n public set(key: K, value: V): this {\r\n let cursor: Map<any, any> = this._map;\r\n for (let i = 0; i < key.length - 1; ++i) {\r\n const subkey = key[i];\r\n let next = cursor.get(subkey);\r\n if (next === undefined) {\r\n next = new Map();\r\n cursor.set(subkey, next);\r\n }\r\n cursor = next;\r\n }\r\n const finalSubkey = key[key.length - 1];\r\n if (!(cursor instanceof Map))\r\n throw this.makeKeyError();\r\n cursor.set(finalSubkey, value);\r\n this._size++;\r\n return this;\r\n }\r\n\r\n public [Symbol.iterator](): IterableIterator<[K, V]> {\r\n function impl(map: Map<any, any>, keyPrefix: readonly any[]): IterableIterator<[K, V]> {\r\n for (const [k, v] of map) {\r\n const nextKey = [...keyPrefix, k];\r\n if (v instanceof Map) {\r\n yield impl(v, nextKey);\r\n } else {\r\n yield [nextKey as any as K, v];\r\n }\r\n }\r\n }\r\n yield* impl(this._map, []);\r\n }\r\n\r\n private _size: number = 0;\r\n public get size(): number {\r\n return this._size;\r\n }\r\n\r\n public get [Symbol.toStringTag](): string {\r\n return this.constructor.name;\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"TupleKeyedMap.js","sourceRoot":"","sources":["../../src/TupleKeyedMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,aAAa;IAChB,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,oCAAoC;IACpC,YAAmB,OAA6C;QAC9D,IAAI,OAAO;YACT,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,CAAC;IACL,CAAC;IAEM,KAAK;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAEO,YAAY;QAClB,OAAO,KAAK,CACV,kEAAkE,CACnE,CAAC;IACJ,CAAC;IAEM,GAAG,CAAC,GAAM;QACf,IAAI,MAAM,GAAsB,IAAI,CAAC,IAAI,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,GAAG,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,MAAM,YAAY,GAAG,CAAC;gBAC1B,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;YAC5B,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,MAAM,YAAY,GAAG;YACvB,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACrC,CAAC;IAEM,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,MAAM,GAAkB,IAAI,CAAC,IAAI,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC,MAAM,YAAY,GAAG,CAAC;YAC1B,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,QAAS,CAAC,CAAA,IAAI,CAAC,GAAkB,EAAE,SAAyB;YAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;oBACrB,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,OAAmB,EAAE,CAAC,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAEO,KAAK,GAAW,CAAC,CAAC;IAC1B,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAW,CAAC,MAAM,CAAC,WAAW,CAAC;QAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IAC/B,CAAC;CACF;AAhFD,sCAgFC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module Collections\n /\n\n/* A map similar to the standard JavaScript Map collection except that the keys must be a tuple\n * (javascript array), and two keys are considered equal if their elements in order are strict-equal,\n * and the tuples have the same amount of elements\n \n This means you can use array literals to key data in Maps that would otherwise be reference-compared\n * if using JavaScript's built in Map\n \n Note that JavaScript's Map type, unlike this one that uses strict equality, uses instead\n * SameValueZero equality comparison\n * @see https://262.ecma-international.org/6.0/#sec-samevaluezero\n \n ```js\n * const map = new TupleKeyedMap([[1,\"y\"], \"value\"]);\n * const value = map.get([1, \"y\"]); // a normal map would identify these keys as different because they are independent objects\n * ```\n \n It is implemented by each index of the tuple key being used as a singular key into a submap\n * @note this only implements a subset of the Map interface\n * @public\n /\nexport class TupleKeyedMap<K extends readonly any[], V> {\n private _map = new Map<K[0], Map<any, V> \| V>();\n\n // argument types match those of Map\n public constructor(entries?: readonly (readonly [K, V])[] \| null) {\n if (entries)\n for (const [k, v] of entries) {\n this.set(k, v);\n }\n }\n\n public clear(): void {\n return this._map.clear();\n }\n\n private makeKeyError() {\n return Error(\n \"A Bad key was used, it didn't match the key type of the the map.\",\n );\n }\n\n public get(key: K): V \| undefined {\n let cursor: Map<any, any> \| V = this._map;\n for (const subkey of key) {\n if (!(cursor instanceof Map))\n throw this.makeKeyError();\n cursor = cursor.get(subkey);\n if (cursor === undefined)\n return undefined;\n }\n if (cursor instanceof Map)\n throw this.makeKeyError();\n return cursor;\n }\n\n public has(key: K): boolean {\n return this.get(key) !== undefined;\n }\n\n public set(key: K, value: V): this {\n let cursor: Map<any, any> = this._map;\n for (let i = 0; i < key.length - 1; ++i) {\n const subkey = key[i];\n let next = cursor.get(subkey);\n if (next === undefined) {\n next = new Map();\n cursor.set(subkey, next);\n }\n cursor = next;\n }\n const finalSubkey = key[key.length - 1];\n if (!(cursor instanceof Map))\n throw this.makeKeyError();\n cursor.set(finalSubkey, value);\n this._size++;\n return this;\n }\n\n public [Symbol.iterator](): IterableIterator<[K, V]> {\n function impl(map: Map<any, any>, keyPrefix: readonly any[]): IterableIterator<[K, V]> {\n for (const [k, v] of map) {\n const nextKey = [...keyPrefix, k];\n if (v instanceof Map) {\n yield impl(v, nextKey);\n } else {\n yield [nextKey as any as K, v];\n }\n }\n }\n yield* impl(this._map, []);\n }\n\n private _size: number = 0;\n public get size(): number {\n return this._size;\n }\n\n public get [Symbol.toStringTag](): string {\n return this.constructor.name;\n }\n}\n"]}