@itwin/ecschema-rpcinterface-tests 4.3.0-dev.11 → 4.3.0-dev.13

package/lib/dist/bundled-tests.js

@@ -82993,7 +82993,7 @@ class SpatialModelState extends GeometricModel3dState {
     }
     /** Return true if this is a reality model (represented by a 3d tile set). */
     get isRealityModel() {
-        return undefined !== this.jsonProperties.tilesetUrl;
+        return !!this.jsonProperties.tilesetUrl || !!this.jsonProperties.rdSourceKey || !!this.jsonProperties.orbitGtBlob;
     }
 }
 /** Represents the front-end state of a [PhysicalModel]($backend).
@@ -93132,6 +93132,12 @@ class Viewport {
      */
     async zoomToElements(ids, options) {
         const placements = await this.iModel.elements.getPlacements(ids, { type: this.view.is3d() ? "3d" : "2d" });
+        if (undefined !== options?.minimumDimension) {
+            for (const placement of placements) {
+                if (placement.isValid && placement instanceof _itwin_core_common__WEBPACK_IMPORTED_MODULE_2__.Placement3d)
+                    placement.bbox.ensureMinLengths(options.minimumDimension);
+            }
+        }
         this.zoomToPlacements(placements, options);
     }
     /** Zoom the view to a volume of space in world coordinates.
@@ -225517,27 +225523,28 @@ __webpack_require__.r(__webpack_exports__);
 
 
 // cspell:word currentdFdX
-/** base class for Newton iterations in various dimensions.
- * Dimension-specific classes carry all dimension-related data and answer generalized queries
- * from this base class.
+/**
+ * Base class for Newton iterations in various dimensions.
+ * Dimension-specific classes carry all dimension-related data and answer generalized queries from this base class.
  * @internal
  */
 class AbstractNewtonIterator {
     /**
+     * The constructor.
      * @param stepSizeTarget tolerance to consider a single step converged.
-     * This number should be "moderately" strict.   Because 2 successive convergences are required,
+     * This number should be "moderately" strict. Because 2 successive convergences are required,
      * it is expected that a first "accept" for (say) 10 to 14 digit step will be followed by another
-     * iteration.   A well behaved newton would then hypothetically double the number of digits to
-     * 20 to 28.  Since the IEEE double only carries 16 digits, this second-convergence step will
+     * iteration. A well behaved newton would then hypothetically double the number of digits to
+     * 20 to 28. Since the IEEE double only carries 16 digits, this second-convergence step will
      * typically achieve full precision.
      * @param successiveConvergenceTarget number of successive convergences required for acceptance.
-     * @param maxIterations max number of iterations.   A typical newton step converges in 3 to 6 iterations.
-     *     Allow 15 to 20 to catch difficult cases.
+     * @param maxIterations max number of iterations. A typical newton step converges in 3 to 6 iterations.
+     * Allow 15 to 20 to catch difficult cases.
      */
     constructor(stepSizeTolerance = 1.0e-11, successiveConvergenceTarget = 2, maxIterations = 15) {
-        /** Number of consecutive steps which passed convergence condition */
+        /** Number of consecutive steps which passed convergence condition. */
         this._numAccepted = 0;
-        /** number of iterations (incremented at each step) */
+        /** Number of iterations (incremented at each step). */
         this.numIterations = 0;
         this._stepSizeTolerance = stepSizeTolerance;
         this._successiveConvergenceTarget = successiveConvergenceTarget;
@@ -225545,8 +225552,9 @@ class AbstractNewtonIterator {
     }
     /**
      * Test if a step is converged.
-     * * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance) occur in succession.
-     * @param delta step size as reported by currentStepSize
+     * * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)
+     * occur in succession.
+     * @param delta step size as reported by currentStepSize.
      */
     testConvergence(delta) {
         if (Math.abs(delta) < this._stepSizeTolerance) {
@@ -225559,16 +225567,15 @@ class AbstractNewtonIterator {
     /**
      * Run iterations, calling various methods from base and derived classes:
      * * computeStep -- typically evaluate derivatives and solve linear system.
-     * * currentStepSize -- return numeric measure of the step just computed by computeStep
+     * * currentStepSize -- return numeric measure of the step just computed by computeStep.
      * * testConvergence -- test if the step from currentStepSize (along with recent steps) is converged.
-     * * applyCurrentStep -- apply the step to the independent variables
+     * * applyCurrentStep -- apply the step to the independent variables.
      */
     runIterations() {
         this._numAccepted = 0;
         this.numIterations = 0;
         while (this.numIterations++ < this._maxIterations && this.computeStep()) {
-            if (this.testConvergence(this.currentStepSize())
-                && this.applyCurrentStep(true)) {
+            if (this.testConvergence(this.currentStepSize()) && this.applyCurrentStep(true)) {
                 return true;
             }
             this.applyCurrentStep(false);
@@ -225576,7 +225583,8 @@ class AbstractNewtonIterator {
         return false;
     }
 }
-/** object to evaluate a newton function.  The object must retain most-recent function and derivative
+/**
+ * Object to evaluate a newton function. The object must retain most-recent function and derivative
  * values for immediate query.
  * @internal
  */
@@ -225584,26 +225592,39 @@ class NewtonEvaluatorRtoRD {
 }
 /**
  * Newton iterator for use when both function and derivative can be evaluated.
+ * To solve `f(x) = 0`, the Newton iteration is `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n)`.
+ * To solve `f(x) = target` which is equivalent to solving  `g(x) = f(x) - target = 0`, the Newton iteration is
+ * `x_{n+1} = x_n - dx = x_n - g(x_n)/g'(x_n) = x_n - (f(x_n)-target)/f'(x_n)`.
  * @internal
  */
 class Newton1dUnbounded extends AbstractNewtonIterator {
     /**
-     * Constructor for 1D newton iteration with approximate derivatives.
-     * @param func function that returns both function and derivative.
+     * Constructor for 1D newton iteration with derivatives.
+     * @param func function that returns both function value and derivative.
      */
     constructor(func) {
         super();
         this._func = func;
         this.setTarget(0);
     }
-    /** Set the independent variable */
-    setX(x) { this._currentX = x; return true; }
-    /** Get the independent variable */
-    getX() { return this._currentX; }
-    /** Set the target function value */
-    setTarget(y) { this._target = y; }
-    /** move the current X by the just-computed step */
-    applyCurrentStep() { return this.setX(this._currentX - this._currentStep); }
+    /** Set the independent variable, i.e., x_n. */
+    setX(x) {
+        this._currentX = x;
+        return true;
+    }
+    /** Get the independent variable, i.e., x_n. */
+    getX() {
+        return this._currentX;
+    }
+    /** Set the target function value. */
+    setTarget(y) {
+        this._target = y;
+    }
+    /** Move the current X by the just-computed step, i.e., `x_n - dx`. */
+    applyCurrentStep() {
+        // console.log(this._currentX - this._currentStep); // print approximations for debug
+        return this.setX(this._currentX - this._currentStep);
+    }
     /** Compute the univariate newton step. */
     computeStep() {
         if (this._func.evaluate(this._currentX)) {
@@ -225615,41 +225636,54 @@ class Newton1dUnbounded extends AbstractNewtonIterator {
         }
         return false;
     }
-    /** Return the current step size as a relative number. */
+    /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
     currentStepSize() {
         return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));
     }
 }
-/** object to evaluate a newton function (without derivative).  The object must retain most-recent function value.
+/**
+ * Object to evaluate a newton function (without derivative). The object must retain most-recent function value.
  * @internal
  */
 class NewtonEvaluatorRtoR {
 }
-/** Newton iteration for a univariate function, using approximate derivatives.
+/**
+ * Newton iteration for a univariate function, using approximate derivatives.
+ * To approximate the derivatives we use a small step `h`, i.e., `f'(x_n) = (f(x_n + h) - f(x_n)) / h`.
+ * Therefore, to solve `f(x) = 0`, the iteration is
+ * `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n) = x_n - f(x_n) * h / (f(x_n + h) - f(x_n))`.
  * @internal
  */
 class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {
     /**
      * Constructor for 1D newton iteration with approximate derivatives.
-     * @param func function that returns both function and derivative.
+     * @param func function that only returns function value (and not derivative).
      */
     constructor(func) {
         super();
         this._func = func;
         this.derivativeH = 1.0e-8;
     }
-    /** Set the x (independent, iterated) value */
-    setX(x) { this._currentX = x; return true; }
-    /** Get the independent variable */
-    getX() { return this._currentX; }
-    /** move the current X by the just-computed step */
-    applyCurrentStep() { return this.setX(this._currentX - this._currentStep); }
-    /** Univariate newton step computed with APPROXIMATE derivative. */
+    /** Set the independent variable, i.e., x_n. */
+    setX(x) {
+        this._currentX = x;
+        return true;
+    }
+    /** Get the independent variable, i.e., x_n. */
+    getX() {
+        return this._currentX;
+    }
+    /** Move the current X by the just-computed step, i.e., `x_n - dx`. */
+    applyCurrentStep() {
+        // console.log(this._currentX - this._currentStep); // print approximations for debug
+        return this.setX(this._currentX - this._currentStep);
+    }
+    /** Univariate newton step computed with approximate derivative. */
     computeStep() {
         if (this._func.evaluate(this._currentX)) {
-            const fA = this._func.currentF;
+            const fA = this._func.currentF; // f(x_n)
             if (this._func.evaluate(this._currentX + this.derivativeH)) {
-                const fB = this._func.currentF;
+                const fB = this._func.currentF; // f(x_n + h)
                 const dx = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(fA, (fB - fA) / this.derivativeH);
                 if (dx !== undefined) {
                     this._currentStep = dx;
@@ -225659,17 +225693,18 @@ class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {
         }
         return false;
     }
-    /** Return the current step size as a relative number. */
+    /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
     currentStepSize() {
         return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));
     }
 }
-/** object to evaluate a 2-parameter newton function (with derivatives!!).
+/**
+ * Object to evaluate a 2-parameter newton function with derivatives.
  * @internal
  */
 class NewtonEvaluatorRRtoRRD {
     /**
-     * constructor.
+     * Constructor.
      * * This creates a currentF object to (repeatedly) receive function and derivatives.
      */
     constructor() {
@@ -225678,25 +225713,49 @@ class NewtonEvaluatorRRtoRRD {
 }
 /**
  * Implement evaluation steps for newton iteration in 2 dimensions, using caller supplied NewtonEvaluatorRRtoRRD object.
+ * * Suppose we want to find the roots of `F(u,v) := (x(u,v), y(u,v))`. Writing `X := (u,v)` and `F(X)` as column vectors,
+ *  the 2D Newton's iteration to find a root of `F` is given by:
+ * `X_{n+1} = X_n - dX = X_n - JInv(X_n)F(X_n)`, where `JInv` is the inverse of the Jacobian matrix `J`, and `J` is
+ * defined as:
+ *
+ * `[dx/du   dx/dv]`
+ *
+ * `[dy/du   dy/dv]`
  * @internal
  */
 class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
+    /**
+     * Constructor for 2D newton iteration with derivatives.
+     * @param func function that returns both function value and derivative.
+     */
     constructor(func) {
         super();
         this._func = func;
         this._currentStep = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.createZero();
         this._currentUV = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Point2d.createZero();
     }
-    /** Set the current uv coordinates for current iteration */
-    setUV(x, y) { this._currentUV.set(x, y); return true; }
-    /** Get the current u coordinate */
-    getU() { return this._currentUV.x; }
-    /** Get the current v coordinate */
-    getV() { return this._currentUV.y; }
-    /** Move the currentUV coordinate by currentStep. */
-    applyCurrentStep() { return this.setUV(this._currentUV.x - this._currentStep.x, this._currentUV.y - this._currentStep.y); }
-    /** Evaluate the functions and derivatives at this._currentUV
-     * Invert the jacobian and compute the this._currentStep.
+    /** Set the current uv parameters, i.e., `X_n = (u_n, v_n)`. */
+    setUV(u, v) {
+        this._currentUV.set(u, v);
+        return true;
+    }
+    /** Get the current u parameter of X_n, i.e., u_n. */
+    getU() {
+        return this._currentUV.x;
+    }
+    /** Get the current v parameter of X_n, i.e., v_n. */
+    getV() {
+        return this._currentUV.y;
+    }
+    /** Update the current uv parameter by currentStep, i.e., compute `X_{n+1} := X_n - dX = (u_n - du, v_n - dv)`. */
+    applyCurrentStep() {
+        // print approximations for debug
+        // console.log("(" + (this._currentUV.x - this._currentStep.x) + "," + (this._currentUV.y - this._currentStep.y) + ")");
+        return this.setUV(this._currentUV.x - this._currentStep.x, this._currentUV.y - this._currentStep.y);
+    }
+    /**
+     * Evaluate the functions and derivatives at `X_n = (u_n, v_n)`, and solve the Jacobian matrix equation to
+     * compute `dX = (du, dv)`.
      */
     computeStep() {
         if (this._func.evaluate(this._currentUV.x, this._currentUV.y)) {
@@ -225707,22 +225766,25 @@ class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
         return false;
     }
     /**
-     * Return the largest relative step of the x,y, components of the current step.
+     * Return the current relative step size, i.e., the larger absolute component of `dX / (1 + |X_n|)`
      */
     currentStepSize() {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.maxAbsXY(this._currentStep.x / (1.0 + Math.abs(this._currentUV.x)), this._currentStep.y / (1.0 + Math.abs(this._currentUV.y)));
     }
 }
 /**
- * SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments (not function object)
+ * SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments
+ * (not function object).
  * @internal
  */
 class SimpleNewton {
-    /** Run a one-dimensional newton iteration with separate functions for function and derivative.
-     * * completion is at 2 (TWO) successive passes at (absoluteTolerance + relTol * abs (x)), where relTol is chosen internally.
-     * * absoluteTolerance is usually aggressively tight -- should come into play only for x near zero.
-     * * The relTol is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after first success
-     *    normally moves to full machine precision.
+    /**
+     * Run a one-dimensional newton iteration with separate functions for function and derivative.
+     * * Completion is at 2 (TWO) successive passes at `absoluteTolerance + relTol * abs(x)`, where relTol is
+     * chosen internally.
+     * * `absoluteTolerance` is usually aggressively tight -- should come into play only for x near zero.
+     * * The `relTol` is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after
+     * first success normally moves to full machine precision.
      * * This is an open-loop newton -- it just runs, and returns undefined if anything bad happens.
      */
     static runNewton1D(x, func, derivative, absoluteTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFloatingPoint) {
@@ -225737,10 +225799,11 @@ class SimpleNewton {
                 if (dx === undefined)
                     return undefined;
                 x -= dx;
+                // console.log(x); // print approximations for debug
                 tolerance = absoluteTolerance + Math.abs(x) * relTol;
                 if (Math.abs(dx) < tolerance) {
                     numConverged++;
-                    if (dx === 0.0 || numConverged > 1) // bypass convergence count on true 0 dx !
+                    if (dx === 0.0 || numConverged > 1) // bypass convergence count on true 0 dx
                         return x;
                 }
                 else {
@@ -227335,7 +227398,7 @@ class SmallSystem {
     }
     /**
      * Solve the pair of linear equations
-     * * `ux * x + vx + y = cx`
+     * * `ux * x + vx * y = cx`
      * * `uy * x + vy * y = cy`
      * @param ux xx coefficient
      * @param vx xy coefficient
@@ -227343,7 +227406,7 @@ class SmallSystem {
      * @param vy yy coefficient
      * @param cx x right hand side
      * @param cy y right hand side
-     * @param result (x,y) solution.  (MUST be preallocated by caller)
+     * @param result (x,y) solution (MUST be preallocated by caller)
      */
     static linearSystem2d(ux, vx, // first row of matrix
     uy, vy, // second row of matrix
@@ -288418,7 +288481,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.3.0-dev.11","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 webpackWorkers && npm run -s copy:workers","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 ES2020 --outDir lib/esm","clean":"rimraf 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:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 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:^4.3.0-dev.11","@itwin/core-bentley":"workspace:^4.3.0-dev.11","@itwin/core-common":"workspace:^4.3.0-dev.11","@itwin/core-geometry":"workspace:^4.3.0-dev.11","@itwin/core-orbitgt":"workspace:^4.3.0-dev.11","@itwin/core-quantity":"workspace:^4.3.0-dev.11"},"//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":{"@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/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","typemoq":"^2.1.0","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.1.0","@itwin/object-storage-core":"^2.1.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.3.0-dev.13","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 webpackWorkers && npm run -s copy:workers","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 ES2020 --outDir lib/esm","clean":"rimraf 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:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 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:^4.3.0-dev.13","@itwin/core-bentley":"workspace:^4.3.0-dev.13","@itwin/core-common":"workspace:^4.3.0-dev.13","@itwin/core-geometry":"workspace:^4.3.0-dev.13","@itwin/core-orbitgt":"workspace:^4.3.0-dev.13","@itwin/core-quantity":"workspace:^4.3.0-dev.13"},"//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":{"@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/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","typemoq":"^2.1.0","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.1.0","@itwin/object-storage-core":"^2.1.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
 
 /***/ })