@itwin/ecschema-rpcinterface-tests 5.16.0-dev.10 → 5.16.0-dev.12

package/lib/dist/bundled-tests.js

@@ -20008,9 +20008,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   OrderedId64Array: () => (/* binding */ OrderedId64Array)
 /* harmony export */ });
 /* harmony import */ var _Assert__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./Assert */ "../../core/bentley/lib/esm/Assert.js");
-/* harmony import */ var _Id__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Id */ "../../core/bentley/lib/esm/Id.js");
-/* harmony import */ var _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./OrderedId64Iterable */ "../../core/bentley/lib/esm/OrderedId64Iterable.js");
-/* harmony import */ var _SortedArray__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./SortedArray */ "../../core/bentley/lib/esm/SortedArray.js");
+/* harmony import */ var _BentleyError__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./BentleyError */ "../../core/bentley/lib/esm/BentleyError.js");
+/* harmony import */ var _Id__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./Id */ "../../core/bentley/lib/esm/Id.js");
+/* harmony import */ var _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./OrderedId64Iterable */ "../../core/bentley/lib/esm/OrderedId64Iterable.js");
+/* harmony import */ var _SortedArray__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./SortedArray */ "../../core/bentley/lib/esm/SortedArray.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -20022,6 +20023,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /** A compact string representation of an [[Id64Set]]. Such a representation is useful when serializing potentially very large
  * sets of Ids.
  * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids represented by a compact string.
@@ -20078,7 +20080,7 @@ var CompressedId64Set;
     function sortAndCompress(ids) {
         // `string` is an Iterable<string>. In that case assume caller passed a single Id64String.
         const arr = typeof ids === "string" ? [ids] : Array.from(ids);
-        _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.sortArray(arr);
+        _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.sortArray(arr);
         return compressArray(arr);
     }
     CompressedId64Set.sortAndCompress = sortAndCompress;
@@ -20114,7 +20116,7 @@ var CompressedId64Set;
         const curId = new Uint64();
         const curIncrement = new Uint64();
         for (const id of ids) {
-            if (!_Id__WEBPACK_IMPORTED_MODULE_1__.Id64.isValidId64(id))
+            if (!_Id__WEBPACK_IMPORTED_MODULE_2__.Id64.isValidId64(id))
                 continue; // ignore garbage and invalid Ids ("0")
             curId.setFromId(id);
             curIncrement.setFromDifference(curId, prevId);
@@ -20190,7 +20192,7 @@ var CompressedId64Set;
             this.assertConstraints();
         }
         setFromId(id) {
-            _Id__WEBPACK_IMPORTED_MODULE_1__.Id64.getUint32Pair(id, this);
+            _Id__WEBPACK_IMPORTED_MODULE_2__.Id64.getUint32Pair(id, this);
         }
         copyFrom(other) {
             this.lower = other.lower;
@@ -20205,48 +20207,80 @@ var CompressedId64Set;
             return `${upper}${lower}`.toUpperCase();
         }
         toId64String() {
-            return _Id__WEBPACK_IMPORTED_MODULE_1__.Id64.fromUint32Pair(this.lower, this.upper);
+            return _Id__WEBPACK_IMPORTED_MODULE_2__.Id64.fromUint32Pair(this.lower, this.upper);
         }
     }
-    /** Supplies an iterator over the [[Id64String]]s in a [[CompressedId64Set]].
-     * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.
+    /** Parses the runs (an increment, optionally repeated `multiplier` times) encoded in a [[CompressedId64Set]],
+     * without materializing the individual Ids.
      */
-    function* iterator(ids) {
-        if (0 === ids.length)
-            return; // empty set.
-        if ("+" !== ids[0])
-            throw new Error("Invalid CompressedId64Set");
-        let curIndex = 1; // skip the leading '+'
-        const curId = new Uint64();
-        function parseUint32() {
+    class RunParser {
+        _ids;
+        _curIndex = 1; // skip the leading '+'
+        increment = new Uint64();
+        multiplier = 1;
+        constructor(_ids) {
+            this._ids = _ids;
+            if (0 !== _ids.length && "+" !== _ids[0])
+                throw new Error("Invalid CompressedId64Set");
+        }
+        /** Parse the next run into [[increment]] and [[multiplier]]. Returns false when there are no more runs. */
+        next() {
+            const ids = this._ids;
+            if (this._curIndex >= ids.length)
+                return false;
+            this.multiplier = 1;
+            this.parseIncrement();
+            if (this.increment.isZero)
+                throw new Error("Invalid CompressedId64Set");
+            if (this._curIndex < ids.length) {
+                switch (ids[this._curIndex++]) {
+                    case "*":
+                        this.multiplier = this.parseUint32();
+                        if (0 === this.multiplier)
+                            throw new Error("Invalid CompressedId64Set");
+                        if (this._curIndex !== ids.length && ids[this._curIndex++] !== "+")
+                            return false;
+                        break;
+                    case "+":
+                        break;
+                    default:
+                        throw new Error("Invalid CompressedId64Set");
+                }
+            }
+            return true;
+        }
+        parseUint32() {
+            const ids = this._ids;
             let value = 0;
             let nChars = 0;
-            while (curIndex < ids.length && nChars < 8) {
+            while (this._curIndex < ids.length && nChars < 8) {
                 ++nChars;
-                const ch = ids.charCodeAt(curIndex);
+                const ch = ids.charCodeAt(this._curIndex);
                 if (!isHexDigit(ch))
                     break; // not a hex digit in [0..9] or [A..F]
                 value <<= 4;
                 value |= (ch >= 65 ? ch - 65 + 10 : ch - 48); // ch - 'A' + 10 or ch - '0'
                 value = value >>> 0; // restore unsignedness because silly javascript.
-                ++curIndex;
+                ++this._curIndex;
             }
             return value;
         }
-        function parseUint64(uint64) {
+        /** Parse a 64-bit hexadecimal value of up to 16 digits into [[increment]]. */
+        parseIncrement() {
+            const ids = this._ids;
             let lower = 0;
             let upper = 0;
             // Read up to the first 8 digits.
-            const startIndex = curIndex;
-            const first = parseUint32();
-            const nFirstDigits = curIndex - startIndex;
+            const startIndex = this._curIndex;
+            const first = this.parseUint32();
+            const nFirstDigits = this._curIndex - startIndex;
             (0,_Assert__WEBPACK_IMPORTED_MODULE_0__.assert)(nFirstDigits <= 8);
-            if (8 === nFirstDigits && curIndex + 1 < ids.length && isHexDigit(ids.charCodeAt(curIndex + 1))) {
+            if (8 === nFirstDigits && this._curIndex + 1 < ids.length && isHexDigit(ids.charCodeAt(this._curIndex + 1))) {
                 // We've got up to 8 more digits remaining
-                const secondIndex = curIndex;
-                const second = parseUint32();
+                const secondIndex = this._curIndex;
+                const second = this.parseUint32();
                 // Transfer excess digits from upper to lower.
-                const nSecondDigits = curIndex - secondIndex;
+                const nSecondDigits = this._curIndex - secondIndex;
                 (0,_Assert__WEBPACK_IMPORTED_MODULE_0__.assert)(nSecondDigits > 0 && nSecondDigits <= 8);
                 const nDigitsToTransfer = 8 - nSecondDigits;
                 upper = first >>> (4 * nDigitsToTransfer);
@@ -20256,37 +20290,63 @@ var CompressedId64Set;
             else {
                 lower = first;
             }
-            uint64.lower = lower;
-            uint64.upper = upper;
+            this.increment.lower = lower;
+            this.increment.upper = upper;
         }
-        const increment = new Uint64();
-        while (curIndex < ids.length) {
-            let multiplier = 1;
-            parseUint64(increment);
-            if (increment.isZero)
-                throw new Error("Invalid CompressedId64Set");
-            if (curIndex < ids.length) {
-                switch (ids[curIndex++]) {
-                    case "*":
-                        multiplier = parseUint32();
-                        if (0 === multiplier)
-                            throw new Error("Invalid CompressedId64Set");
-                        if (curIndex !== ids.length && ids[curIndex++] !== "+")
-                            return;
-                        break;
-                    case "+":
-                        break;
-                    default:
-                        throw new Error("Invalid CompressedId64Set");
-                }
-            }
-            for (let i = 0; i < multiplier; i++) {
-                curId.add(increment);
+    }
+    /** The maximum number of Ids that [[CompressedId64Set.iterator]] will produce from a single [[CompressedId64Set]].
+     * A short compressed string can represent billions of Ids, so [[CompressedId64Set.iterator]] counts the Ids before producing any of them,
+     * and throws a [[BentleyError]] with [[IModelStatus.BadArg]] if the count exceeds this limit.
+     * The limit applies equally to [[CompressedId64Set.iterable]], [[CompressedId64Set.decompressSet]], [[CompressedId64Set.decompressArray]],
+     * and [[MutableCompressedId64Set]].
+     * @beta
+     */
+    CompressedId64Set.maxIdCount = 1000000;
+    /** Supplies an iterator over the [[Id64String]]s in a [[CompressedId64Set]].
+     * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.
+     * @throws [[BentleyError]] with [[IModelStatus.BadArg]] if `ids` represents more than [[CompressedId64Set.maxIdCount]] Ids.
+     */
+    function* iterator(ids) {
+        let numIds = 0;
+        const counter = new RunParser(ids);
+        while (counter.next()) {
+            numIds += counter.multiplier;
+            if (numIds > CompressedId64Set.maxIdCount)
+                throw new _BentleyError__WEBPACK_IMPORTED_MODULE_1__.BentleyError(_BentleyError__WEBPACK_IMPORTED_MODULE_1__.IModelStatus.BadArg, `CompressedId64Set exceeds the maximum of ${CompressedId64Set.maxIdCount} Ids`);
+        }
+        const parser = new RunParser(ids);
+        const curId = new Uint64();
+        while (parser.next()) {
+            for (let i = 0; i < parser.multiplier; i++) {
+                curId.add(parser.increment);
                 yield curId.toId64String();
             }
         }
     }
     CompressedId64Set.iterator = iterator;
+    /** Compute the number of Ids represented by a [[CompressedId64Set]] without materializing them.
+     * The cost is proportional to the length of the string, not to the number of Ids it represents.
+     * Use this to bound the work of decompressing a set obtained from an untrusted source, such as an RPC argument.
+     * @param ids The compact string representation.
+     * @returns The number of Ids that [[CompressedId64Set.iterator]] would produce.
+     * @throws Error if `ids` is not a well-formed [[CompressedId64Set]], including if any of the Ids it represents would exceed 64 bits.
+     * @beta
+     */
+    function count(ids) {
+        const maxId = 0xffffffffffffffffn;
+        let total = 0;
+        let lastId = 0n;
+        const parser = new RunParser(ids);
+        while (parser.next()) {
+            total += parser.multiplier;
+            const increment = (BigInt(parser.increment.upper) << 32n) | BigInt(parser.increment.lower);
+            lastId += increment * BigInt(parser.multiplier);
+            if (lastId > maxId)
+                throw new Error("CompressedId64Set contains an Id that exceeds the maximum 64-bit value");
+        }
+        return total;
+    }
+    CompressedId64Set.count = count;
     /** Supplies an iterable over the [[Id64String]]s in a [[CompressedId64Set]].
      * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.
      */
@@ -20301,6 +20361,7 @@ var CompressedId64Set;
      * @param out If supplied, the Ids will be inserted into this set rather than allocating and returning a new set.
      * @returns The set containing the decompressed Ids.
      * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].
+     * @throws [[BentleyError]] with [[IModelStatus.BadArg]] if `compressedIds` represents more than [[CompressedId64Set.maxIdCount]] Ids.
      * @see [[CompressedId64Set.compressSet]] to perform the inverse operation.
      * @see [[CompressedId64Set.decompressArray]] to decompress as an [[Id64Array]] instead.
      * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.
@@ -20317,6 +20378,7 @@ var CompressedId64Set;
      * @param out If supplied, the Ids will be appended to this array rather than allocating and returning a new array.
      * @returns The array containing the decompressed Ids.
      * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].
+     * @throws [[BentleyError]] with [[IModelStatus.BadArg]] if `compressedIds` represents more than [[CompressedId64Set.maxIdCount]] Ids.
      * @note The Ids are decompressed and appended to the array in ascending order based on their 64-bit numerical values.
      * @see [[CompressedId64Set.compressArray]] to perform the inverse operation.
      * @see [[CompressedId64Set.decompressSet]] to decompress as an [[Id64Set]] instead.
@@ -20334,10 +20396,10 @@ var CompressedId64Set;
  * @see [[CompressedId64Set]] for an immutable compact string representation.
  * @public
  */
-class OrderedId64Array extends _SortedArray__WEBPACK_IMPORTED_MODULE_3__.SortedArray {
+class OrderedId64Array extends _SortedArray__WEBPACK_IMPORTED_MODULE_4__.SortedArray {
     /** Construct a new, empty array. */
     constructor() {
-        super((lhs, rhs) => _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.compare(lhs, rhs));
+        super((lhs, rhs) => _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.compare(lhs, rhs));
     }
     /** An iterable that iterates over the Ids in sorted order. */
     get ids() { return this._array; }
@@ -20367,7 +20429,7 @@ class MutableCompressedId64Set {
      * @throws Error if `id` is not a valid [[Id64String]].
      */
     add(id) {
-        if (!_Id__WEBPACK_IMPORTED_MODULE_1__.Id64.isValidId64(id))
+        if (!_Id__WEBPACK_IMPORTED_MODULE_2__.Id64.isValidId64(id))
             throw new Error("MutableCompressedId64Set.add: invalid Id");
         this._deleted.remove(id);
         this._inserted.insert(id);
@@ -20376,7 +20438,7 @@ class MutableCompressedId64Set {
      * @throws Error if `id` is not a valid [[Id64String]].
      */
     delete(id) {
-        if (!_Id__WEBPACK_IMPORTED_MODULE_1__.Id64.isValidId64(id))
+        if (!_Id__WEBPACK_IMPORTED_MODULE_2__.Id64.isValidId64(id))
             throw new Error("MutableCompressedId64Set.delete: invalid Id");
         this._inserted.remove(id);
         this._deleted.insert(id);
@@ -20400,27 +20462,27 @@ class MutableCompressedId64Set {
     computeUnion(ids) {
         if (this.isEmpty)
             return CompressedId64Set.compressIds(ids);
-        else if (_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.isEmptySet(ids) || this.equals(ids))
+        else if (_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.isEmptySet(ids) || this.equals(ids))
             return this.ids;
-        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.union(this, ids));
+        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.union(this, ids));
     }
     /** Compute a compact string representation of the intersection of this and another set of Ids - i.e., those Ids present in both this and the other set. */
     computeIntersection(ids) {
         if (this.equals(ids))
             return this.ids;
-        else if (this.isEmpty || _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.isEmptySet(ids))
+        else if (this.isEmpty || _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.isEmptySet(ids))
             return "";
-        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.intersection(this, ids));
+        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.intersection(this, ids));
     }
     /** Compute a compact string representation of the difference between this and another set - i.e., those Ids present in this but not in the other set. */
     computeDifference(ids) {
         if (this.isEmpty || this.equals(ids))
             return "";
-        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.difference(this, ids));
+        return CompressedId64Set.compressIds(_OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.difference(this, ids));
     }
     /** Return true if this set contains no Ids. */
     get isEmpty() {
-        return _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.isEmptySet(this.ids);
+        return _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.isEmptySet(this.ids);
     }
     /** Return true if the set of Ids represented by `other` is identical to those in this set.
      * @note This considers only the **distinct** Ids in `other` - duplicates are ignored.
@@ -20435,7 +20497,7 @@ class MutableCompressedId64Set {
         if (typeof other === "string")
             return other === this.ids;
         this.updateIds();
-        return _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.areEqualSets(this, other);
+        return _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.areEqualSets(this, other);
     }
     get _isDirty() {
         return !this._inserted.isEmpty || !this._deleted.isEmpty;
@@ -20443,8 +20505,8 @@ class MutableCompressedId64Set {
     updateIds() {
         if (!this._isDirty)
             return;
-        const difference = _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.difference(CompressedId64Set.iterable(this._ids), this._deleted.ids);
-        const union = { [Symbol.iterator]: () => _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_2__.OrderedId64Iterable.unionIterator(difference, this._inserted.ids) };
+        const difference = _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.difference(CompressedId64Set.iterable(this._ids), this._deleted.ids);
+        const union = { [Symbol.iterator]: () => _OrderedId64Iterable__WEBPACK_IMPORTED_MODULE_3__.OrderedId64Iterable.unionIterator(difference, this._inserted.ids) };
         this._ids = CompressedId64Set.compressIds(union);
         this._inserted.clear();
         this._deleted.clear();
@@ -338273,7 +338335,7 @@ class WMS {
 (module) {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.16.0-dev.10","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s build:workers && npm run -s copy:draco","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2022 --outDir lib/esm","clean":"rimraf -g lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run build:test-worker && vitest --run","cover":"npm run build:test-worker && vitest --run","build:test-worker":"vite build --config ./src/test/worker/vite.config.mts 1>&2","build:workers":"rimraf lib/workers/webpack && vite build --config ./src/workers/ImdlParser/vite.config.mts 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@bentley/aec-units-schema":"catalog:schemas","@bentley/formats-schema":"catalog:schemas","@bentley/units-schema":"catalog:schemas","@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"catalog:imodels-clients","@itwin/eslint-plugin":"catalog:linting","@types/node":"catalog:build","@types/sinon":"catalog:testing","@vitest/browser-playwright":"catalog:testing","@vitest/coverage-v8":"catalog:testing","cpx2":"catalog:build","eslint":"catalog:linting","playwright":"catalog:testing","rimraf":"catalog:build","sinon":"catalog:testing","typescript":"catalog:build","vite":"catalog:bundling","vitest":"catalog:testing"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^4.4.5","@loaders.gl/draco":"^4.4.5","fuse.js":"^3.3.0","wms-capabilities":"0.6.0"}}');
+module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.16.0-dev.12","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s build:workers && npm run -s copy:draco","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2022 --outDir lib/esm","clean":"rimraf -g lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run build:test-worker && vitest --run","cover":"npm run build:test-worker && vitest --run","build:test-worker":"vite build --config ./src/test/worker/vite.config.mts 1>&2","build:workers":"rimraf lib/workers/webpack && vite build --config ./src/workers/ImdlParser/vite.config.mts 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@bentley/aec-units-schema":"catalog:schemas","@bentley/formats-schema":"catalog:schemas","@bentley/units-schema":"catalog:schemas","@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"catalog:imodels-clients","@itwin/eslint-plugin":"catalog:linting","@types/node":"catalog:build","@types/sinon":"catalog:testing","@vitest/browser-playwright":"catalog:testing","@vitest/coverage-v8":"catalog:testing","cpx2":"catalog:build","eslint":"catalog:linting","playwright":"catalog:testing","rimraf":"catalog:build","sinon":"catalog:testing","typescript":"catalog:build","vite":"catalog:bundling","vitest":"catalog:testing"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^4.4.5","@loaders.gl/draco":"^4.4.5","fuse.js":"^3.3.0","wms-capabilities":"0.6.0"}}');
 
 /***/ },