@itwin/rpcinterface-full-stack-tests 4.3.0-dev.10 → 4.3.0-dev.12
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.
- package/lib/dist/bundled-tests.js +130 -67
- package/lib/dist/bundled-tests.js.map +1 -1
- package/lib/dist/core_frontend_lib_esm_ApproximateTerrainHeightsProps_js.bundled-tests.js.map +1 -1
- package/lib/dist/vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_14_node_modules_loaders_gl_draco_d-aa4ff5.bundled-tests.js.map +1 -1
- package/package.json +13 -13
|
@@ -85569,7 +85569,7 @@ class SpatialModelState extends GeometricModel3dState {
|
|
|
85569
85569
|
}
|
|
85570
85570
|
/** Return true if this is a reality model (represented by a 3d tile set). */
|
|
85571
85571
|
get isRealityModel() {
|
|
85572
|
-
return
|
|
85572
|
+
return !!this.jsonProperties.tilesetUrl || !!this.jsonProperties.rdSourceKey || !!this.jsonProperties.orbitGtBlob;
|
|
85573
85573
|
}
|
|
85574
85574
|
}
|
|
85575
85575
|
/** Represents the front-end state of a [PhysicalModel]($backend).
|
|
@@ -95708,6 +95708,12 @@ class Viewport {
|
|
|
95708
95708
|
*/
|
|
95709
95709
|
async zoomToElements(ids, options) {
|
|
95710
95710
|
const placements = await this.iModel.elements.getPlacements(ids, { type: this.view.is3d() ? "3d" : "2d" });
|
|
95711
|
+
if (undefined !== options?.minimumDimension) {
|
|
95712
|
+
for (const placement of placements) {
|
|
95713
|
+
if (placement.isValid && placement instanceof _itwin_core_common__WEBPACK_IMPORTED_MODULE_2__.Placement3d)
|
|
95714
|
+
placement.bbox.ensureMinLengths(options.minimumDimension);
|
|
95715
|
+
}
|
|
95716
|
+
}
|
|
95711
95717
|
this.zoomToPlacements(placements, options);
|
|
95712
95718
|
}
|
|
95713
95719
|
/** Zoom the view to a volume of space in world coordinates.
|
|
@@ -228093,27 +228099,28 @@ __webpack_require__.r(__webpack_exports__);
|
|
|
228093
228099
|
|
|
228094
228100
|
|
|
228095
228101
|
// cspell:word currentdFdX
|
|
228096
|
-
/**
|
|
228097
|
-
*
|
|
228098
|
-
* from this base class.
|
|
228102
|
+
/**
|
|
228103
|
+
* Base class for Newton iterations in various dimensions.
|
|
228104
|
+
* Dimension-specific classes carry all dimension-related data and answer generalized queries from this base class.
|
|
228099
228105
|
* @internal
|
|
228100
228106
|
*/
|
|
228101
228107
|
class AbstractNewtonIterator {
|
|
228102
228108
|
/**
|
|
228109
|
+
* The constructor.
|
|
228103
228110
|
* @param stepSizeTarget tolerance to consider a single step converged.
|
|
228104
|
-
* This number should be "moderately" strict.
|
|
228111
|
+
* This number should be "moderately" strict. Because 2 successive convergences are required,
|
|
228105
228112
|
* it is expected that a first "accept" for (say) 10 to 14 digit step will be followed by another
|
|
228106
|
-
* iteration.
|
|
228107
|
-
* 20 to 28.
|
|
228113
|
+
* iteration. A well behaved newton would then hypothetically double the number of digits to
|
|
228114
|
+
* 20 to 28. Since the IEEE double only carries 16 digits, this second-convergence step will
|
|
228108
228115
|
* typically achieve full precision.
|
|
228109
228116
|
* @param successiveConvergenceTarget number of successive convergences required for acceptance.
|
|
228110
|
-
* @param maxIterations max number of iterations.
|
|
228111
|
-
*
|
|
228117
|
+
* @param maxIterations max number of iterations. A typical newton step converges in 3 to 6 iterations.
|
|
228118
|
+
* Allow 15 to 20 to catch difficult cases.
|
|
228112
228119
|
*/
|
|
228113
228120
|
constructor(stepSizeTolerance = 1.0e-11, successiveConvergenceTarget = 2, maxIterations = 15) {
|
|
228114
|
-
/** Number of consecutive steps which passed convergence condition */
|
|
228121
|
+
/** Number of consecutive steps which passed convergence condition. */
|
|
228115
228122
|
this._numAccepted = 0;
|
|
228116
|
-
/**
|
|
228123
|
+
/** Number of iterations (incremented at each step). */
|
|
228117
228124
|
this.numIterations = 0;
|
|
228118
228125
|
this._stepSizeTolerance = stepSizeTolerance;
|
|
228119
228126
|
this._successiveConvergenceTarget = successiveConvergenceTarget;
|
|
@@ -228121,8 +228128,9 @@ class AbstractNewtonIterator {
|
|
|
228121
228128
|
}
|
|
228122
228129
|
/**
|
|
228123
228130
|
* Test if a step is converged.
|
|
228124
|
-
* * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)
|
|
228125
|
-
*
|
|
228131
|
+
* * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)
|
|
228132
|
+
* occur in succession.
|
|
228133
|
+
* @param delta step size as reported by currentStepSize.
|
|
228126
228134
|
*/
|
|
228127
228135
|
testConvergence(delta) {
|
|
228128
228136
|
if (Math.abs(delta) < this._stepSizeTolerance) {
|
|
@@ -228135,16 +228143,15 @@ class AbstractNewtonIterator {
|
|
|
228135
228143
|
/**
|
|
228136
228144
|
* Run iterations, calling various methods from base and derived classes:
|
|
228137
228145
|
* * computeStep -- typically evaluate derivatives and solve linear system.
|
|
228138
|
-
* * currentStepSize -- return numeric measure of the step just computed by computeStep
|
|
228146
|
+
* * currentStepSize -- return numeric measure of the step just computed by computeStep.
|
|
228139
228147
|
* * testConvergence -- test if the step from currentStepSize (along with recent steps) is converged.
|
|
228140
|
-
* * applyCurrentStep -- apply the step to the independent variables
|
|
228148
|
+
* * applyCurrentStep -- apply the step to the independent variables.
|
|
228141
228149
|
*/
|
|
228142
228150
|
runIterations() {
|
|
228143
228151
|
this._numAccepted = 0;
|
|
228144
228152
|
this.numIterations = 0;
|
|
228145
228153
|
while (this.numIterations++ < this._maxIterations && this.computeStep()) {
|
|
228146
|
-
if (this.testConvergence(this.currentStepSize())
|
|
228147
|
-
&& this.applyCurrentStep(true)) {
|
|
228154
|
+
if (this.testConvergence(this.currentStepSize()) && this.applyCurrentStep(true)) {
|
|
228148
228155
|
return true;
|
|
228149
228156
|
}
|
|
228150
228157
|
this.applyCurrentStep(false);
|
|
@@ -228152,7 +228159,8 @@ class AbstractNewtonIterator {
|
|
|
228152
228159
|
return false;
|
|
228153
228160
|
}
|
|
228154
228161
|
}
|
|
228155
|
-
/**
|
|
228162
|
+
/**
|
|
228163
|
+
* Object to evaluate a newton function. The object must retain most-recent function and derivative
|
|
228156
228164
|
* values for immediate query.
|
|
228157
228165
|
* @internal
|
|
228158
228166
|
*/
|
|
@@ -228160,26 +228168,39 @@ class NewtonEvaluatorRtoRD {
|
|
|
228160
228168
|
}
|
|
228161
228169
|
/**
|
|
228162
228170
|
* Newton iterator for use when both function and derivative can be evaluated.
|
|
228171
|
+
* To solve `f(x) = 0`, the Newton iteration is `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n)`.
|
|
228172
|
+
* To solve `f(x) = target` which is equivalent to solving `g(x) = f(x) - target = 0`, the Newton iteration is
|
|
228173
|
+
* `x_{n+1} = x_n - dx = x_n - g(x_n)/g'(x_n) = x_n - (f(x_n)-target)/f'(x_n)`.
|
|
228163
228174
|
* @internal
|
|
228164
228175
|
*/
|
|
228165
228176
|
class Newton1dUnbounded extends AbstractNewtonIterator {
|
|
228166
228177
|
/**
|
|
228167
|
-
* Constructor for 1D newton iteration with
|
|
228168
|
-
* @param func function that returns both function and derivative.
|
|
228178
|
+
* Constructor for 1D newton iteration with derivatives.
|
|
228179
|
+
* @param func function that returns both function value and derivative.
|
|
228169
228180
|
*/
|
|
228170
228181
|
constructor(func) {
|
|
228171
228182
|
super();
|
|
228172
228183
|
this._func = func;
|
|
228173
228184
|
this.setTarget(0);
|
|
228174
228185
|
}
|
|
228175
|
-
/** Set the independent variable */
|
|
228176
|
-
setX(x) {
|
|
228177
|
-
|
|
228178
|
-
|
|
228179
|
-
|
|
228180
|
-
|
|
228181
|
-
|
|
228182
|
-
|
|
228186
|
+
/** Set the independent variable, i.e., x_n. */
|
|
228187
|
+
setX(x) {
|
|
228188
|
+
this._currentX = x;
|
|
228189
|
+
return true;
|
|
228190
|
+
}
|
|
228191
|
+
/** Get the independent variable, i.e., x_n. */
|
|
228192
|
+
getX() {
|
|
228193
|
+
return this._currentX;
|
|
228194
|
+
}
|
|
228195
|
+
/** Set the target function value. */
|
|
228196
|
+
setTarget(y) {
|
|
228197
|
+
this._target = y;
|
|
228198
|
+
}
|
|
228199
|
+
/** Move the current X by the just-computed step, i.e., `x_n - dx`. */
|
|
228200
|
+
applyCurrentStep() {
|
|
228201
|
+
// console.log(this._currentX - this._currentStep); // print approximations for debug
|
|
228202
|
+
return this.setX(this._currentX - this._currentStep);
|
|
228203
|
+
}
|
|
228183
228204
|
/** Compute the univariate newton step. */
|
|
228184
228205
|
computeStep() {
|
|
228185
228206
|
if (this._func.evaluate(this._currentX)) {
|
|
@@ -228191,41 +228212,54 @@ class Newton1dUnbounded extends AbstractNewtonIterator {
|
|
|
228191
228212
|
}
|
|
228192
228213
|
return false;
|
|
228193
228214
|
}
|
|
228194
|
-
/** Return the current step size as a relative number. */
|
|
228215
|
+
/** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
|
|
228195
228216
|
currentStepSize() {
|
|
228196
228217
|
return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));
|
|
228197
228218
|
}
|
|
228198
228219
|
}
|
|
228199
|
-
/**
|
|
228220
|
+
/**
|
|
228221
|
+
* Object to evaluate a newton function (without derivative). The object must retain most-recent function value.
|
|
228200
228222
|
* @internal
|
|
228201
228223
|
*/
|
|
228202
228224
|
class NewtonEvaluatorRtoR {
|
|
228203
228225
|
}
|
|
228204
|
-
/**
|
|
228226
|
+
/**
|
|
228227
|
+
* Newton iteration for a univariate function, using approximate derivatives.
|
|
228228
|
+
* To approximate the derivatives we use a small step `h`, i.e., `f'(x_n) = (f(x_n + h) - f(x_n)) / h`.
|
|
228229
|
+
* Therefore, to solve `f(x) = 0`, the iteration is
|
|
228230
|
+
* `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))`.
|
|
228205
228231
|
* @internal
|
|
228206
228232
|
*/
|
|
228207
228233
|
class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {
|
|
228208
228234
|
/**
|
|
228209
228235
|
* Constructor for 1D newton iteration with approximate derivatives.
|
|
228210
|
-
* @param func function that returns
|
|
228236
|
+
* @param func function that only returns function value (and not derivative).
|
|
228211
228237
|
*/
|
|
228212
228238
|
constructor(func) {
|
|
228213
228239
|
super();
|
|
228214
228240
|
this._func = func;
|
|
228215
228241
|
this.derivativeH = 1.0e-8;
|
|
228216
228242
|
}
|
|
228217
|
-
/** Set the
|
|
228218
|
-
setX(x) {
|
|
228219
|
-
|
|
228220
|
-
|
|
228221
|
-
|
|
228222
|
-
|
|
228223
|
-
|
|
228243
|
+
/** Set the independent variable, i.e., x_n. */
|
|
228244
|
+
setX(x) {
|
|
228245
|
+
this._currentX = x;
|
|
228246
|
+
return true;
|
|
228247
|
+
}
|
|
228248
|
+
/** Get the independent variable, i.e., x_n. */
|
|
228249
|
+
getX() {
|
|
228250
|
+
return this._currentX;
|
|
228251
|
+
}
|
|
228252
|
+
/** Move the current X by the just-computed step, i.e., `x_n - dx`. */
|
|
228253
|
+
applyCurrentStep() {
|
|
228254
|
+
// console.log(this._currentX - this._currentStep); // print approximations for debug
|
|
228255
|
+
return this.setX(this._currentX - this._currentStep);
|
|
228256
|
+
}
|
|
228257
|
+
/** Univariate newton step computed with approximate derivative. */
|
|
228224
228258
|
computeStep() {
|
|
228225
228259
|
if (this._func.evaluate(this._currentX)) {
|
|
228226
|
-
const fA = this._func.currentF;
|
|
228260
|
+
const fA = this._func.currentF; // f(x_n)
|
|
228227
228261
|
if (this._func.evaluate(this._currentX + this.derivativeH)) {
|
|
228228
|
-
const fB = this._func.currentF;
|
|
228262
|
+
const fB = this._func.currentF; // f(x_n + h)
|
|
228229
228263
|
const dx = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(fA, (fB - fA) / this.derivativeH);
|
|
228230
228264
|
if (dx !== undefined) {
|
|
228231
228265
|
this._currentStep = dx;
|
|
@@ -228235,17 +228269,18 @@ class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {
|
|
|
228235
228269
|
}
|
|
228236
228270
|
return false;
|
|
228237
228271
|
}
|
|
228238
|
-
/** Return the current step size as a relative number. */
|
|
228272
|
+
/** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
|
|
228239
228273
|
currentStepSize() {
|
|
228240
228274
|
return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));
|
|
228241
228275
|
}
|
|
228242
228276
|
}
|
|
228243
|
-
/**
|
|
228277
|
+
/**
|
|
228278
|
+
* Object to evaluate a 2-parameter newton function with derivatives.
|
|
228244
228279
|
* @internal
|
|
228245
228280
|
*/
|
|
228246
228281
|
class NewtonEvaluatorRRtoRRD {
|
|
228247
228282
|
/**
|
|
228248
|
-
*
|
|
228283
|
+
* Constructor.
|
|
228249
228284
|
* * This creates a currentF object to (repeatedly) receive function and derivatives.
|
|
228250
228285
|
*/
|
|
228251
228286
|
constructor() {
|
|
@@ -228254,25 +228289,49 @@ class NewtonEvaluatorRRtoRRD {
|
|
|
228254
228289
|
}
|
|
228255
228290
|
/**
|
|
228256
228291
|
* Implement evaluation steps for newton iteration in 2 dimensions, using caller supplied NewtonEvaluatorRRtoRRD object.
|
|
228292
|
+
* * 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,
|
|
228293
|
+
* the 2D Newton's iteration to find a root of `F` is given by:
|
|
228294
|
+
* `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
|
|
228295
|
+
* defined as:
|
|
228296
|
+
*
|
|
228297
|
+
* `[dx/du dx/dv]`
|
|
228298
|
+
*
|
|
228299
|
+
* `[dy/du dy/dv]`
|
|
228257
228300
|
* @internal
|
|
228258
228301
|
*/
|
|
228259
228302
|
class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
|
|
228303
|
+
/**
|
|
228304
|
+
* Constructor for 2D newton iteration with derivatives.
|
|
228305
|
+
* @param func function that returns both function value and derivative.
|
|
228306
|
+
*/
|
|
228260
228307
|
constructor(func) {
|
|
228261
228308
|
super();
|
|
228262
228309
|
this._func = func;
|
|
228263
228310
|
this._currentStep = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.createZero();
|
|
228264
228311
|
this._currentUV = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Point2d.createZero();
|
|
228265
228312
|
}
|
|
228266
|
-
/** Set the current uv
|
|
228267
|
-
setUV(
|
|
228268
|
-
|
|
228269
|
-
|
|
228270
|
-
|
|
228271
|
-
|
|
228272
|
-
|
|
228273
|
-
|
|
228274
|
-
|
|
228275
|
-
|
|
228313
|
+
/** Set the current uv parameters, i.e., `X_n = (u_n, v_n)`. */
|
|
228314
|
+
setUV(u, v) {
|
|
228315
|
+
this._currentUV.set(u, v);
|
|
228316
|
+
return true;
|
|
228317
|
+
}
|
|
228318
|
+
/** Get the current u parameter of X_n, i.e., u_n. */
|
|
228319
|
+
getU() {
|
|
228320
|
+
return this._currentUV.x;
|
|
228321
|
+
}
|
|
228322
|
+
/** Get the current v parameter of X_n, i.e., v_n. */
|
|
228323
|
+
getV() {
|
|
228324
|
+
return this._currentUV.y;
|
|
228325
|
+
}
|
|
228326
|
+
/** Update the current uv parameter by currentStep, i.e., compute `X_{n+1} := X_n - dX = (u_n - du, v_n - dv)`. */
|
|
228327
|
+
applyCurrentStep() {
|
|
228328
|
+
// print approximations for debug
|
|
228329
|
+
// console.log("(" + (this._currentUV.x - this._currentStep.x) + "," + (this._currentUV.y - this._currentStep.y) + ")");
|
|
228330
|
+
return this.setUV(this._currentUV.x - this._currentStep.x, this._currentUV.y - this._currentStep.y);
|
|
228331
|
+
}
|
|
228332
|
+
/**
|
|
228333
|
+
* Evaluate the functions and derivatives at `X_n = (u_n, v_n)`, and solve the Jacobian matrix equation to
|
|
228334
|
+
* compute `dX = (du, dv)`.
|
|
228276
228335
|
*/
|
|
228277
228336
|
computeStep() {
|
|
228278
228337
|
if (this._func.evaluate(this._currentUV.x, this._currentUV.y)) {
|
|
@@ -228283,22 +228342,25 @@ class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
|
|
|
228283
228342
|
return false;
|
|
228284
228343
|
}
|
|
228285
228344
|
/**
|
|
228286
|
-
* Return the
|
|
228345
|
+
* Return the current relative step size, i.e., the larger absolute component of `dX / (1 + |X_n|)`
|
|
228287
228346
|
*/
|
|
228288
228347
|
currentStepSize() {
|
|
228289
228348
|
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)));
|
|
228290
228349
|
}
|
|
228291
228350
|
}
|
|
228292
228351
|
/**
|
|
228293
|
-
* SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments
|
|
228352
|
+
* SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments
|
|
228353
|
+
* (not function object).
|
|
228294
228354
|
* @internal
|
|
228295
228355
|
*/
|
|
228296
228356
|
class SimpleNewton {
|
|
228297
|
-
/**
|
|
228298
|
-
*
|
|
228299
|
-
* *
|
|
228300
|
-
*
|
|
228301
|
-
*
|
|
228357
|
+
/**
|
|
228358
|
+
* Run a one-dimensional newton iteration with separate functions for function and derivative.
|
|
228359
|
+
* * Completion is at 2 (TWO) successive passes at `absoluteTolerance + relTol * abs(x)`, where relTol is
|
|
228360
|
+
* chosen internally.
|
|
228361
|
+
* * `absoluteTolerance` is usually aggressively tight -- should come into play only for x near zero.
|
|
228362
|
+
* * The `relTol` is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after
|
|
228363
|
+
* first success normally moves to full machine precision.
|
|
228302
228364
|
* * This is an open-loop newton -- it just runs, and returns undefined if anything bad happens.
|
|
228303
228365
|
*/
|
|
228304
228366
|
static runNewton1D(x, func, derivative, absoluteTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFloatingPoint) {
|
|
@@ -228313,10 +228375,11 @@ class SimpleNewton {
|
|
|
228313
228375
|
if (dx === undefined)
|
|
228314
228376
|
return undefined;
|
|
228315
228377
|
x -= dx;
|
|
228378
|
+
// console.log(x); // print approximations for debug
|
|
228316
228379
|
tolerance = absoluteTolerance + Math.abs(x) * relTol;
|
|
228317
228380
|
if (Math.abs(dx) < tolerance) {
|
|
228318
228381
|
numConverged++;
|
|
228319
|
-
if (dx === 0.0 || numConverged > 1) // bypass convergence count on true 0 dx
|
|
228382
|
+
if (dx === 0.0 || numConverged > 1) // bypass convergence count on true 0 dx
|
|
228320
228383
|
return x;
|
|
228321
228384
|
}
|
|
228322
228385
|
else {
|
|
@@ -229911,7 +229974,7 @@ class SmallSystem {
|
|
|
229911
229974
|
}
|
|
229912
229975
|
/**
|
|
229913
229976
|
* Solve the pair of linear equations
|
|
229914
|
-
* * `ux * x + vx
|
|
229977
|
+
* * `ux * x + vx * y = cx`
|
|
229915
229978
|
* * `uy * x + vy * y = cy`
|
|
229916
229979
|
* @param ux xx coefficient
|
|
229917
229980
|
* @param vx xy coefficient
|
|
@@ -229919,7 +229982,7 @@ class SmallSystem {
|
|
|
229919
229982
|
* @param vy yy coefficient
|
|
229920
229983
|
* @param cx x right hand side
|
|
229921
229984
|
* @param cy y right hand side
|
|
229922
|
-
* @param result (x,y) solution
|
|
229985
|
+
* @param result (x,y) solution (MUST be preallocated by caller)
|
|
229923
229986
|
*/
|
|
229924
229987
|
static linearSystem2d(ux, vx, // first row of matrix
|
|
229925
229988
|
uy, vy, // second row of matrix
|
|
@@ -236397,7 +236460,7 @@ class PolyfaceData {
|
|
|
236397
236460
|
this._twoSided = twoSided;
|
|
236398
236461
|
this._expectedClosure = 0;
|
|
236399
236462
|
}
|
|
236400
|
-
/** Return a
|
|
236463
|
+
/** Return a deep clone. */
|
|
236401
236464
|
clone() {
|
|
236402
236465
|
const result = new PolyfaceData();
|
|
236403
236466
|
result.point = this.point.clone();
|
|
@@ -280714,7 +280777,7 @@ class TestContext {
|
|
|
280714
280777
|
this.initializeRpcInterfaces({ title: this.settings.Backend.name, version: this.settings.Backend.version });
|
|
280715
280778
|
const iModelClient = new imodels_client_management_1.IModelsClient({ api: { baseUrl: `https://${process.env.IMJS_URL_PREFIX ?? ""}api.bentley.com/imodels` } });
|
|
280716
280779
|
await core_frontend_1.NoRenderApp.startup({
|
|
280717
|
-
applicationVersion: "4.3.0-dev.
|
|
280780
|
+
applicationVersion: "4.3.0-dev.12",
|
|
280718
280781
|
applicationId: this.settings.gprid,
|
|
280719
280782
|
authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
|
|
280720
280783
|
hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
|
|
@@ -300122,7 +300185,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
|
|
|
300122
300185
|
/***/ ((module) => {
|
|
300123
300186
|
|
|
300124
300187
|
"use strict";
|
|
300125
|
-
module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.3.0-dev.
|
|
300188
|
+
module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.3.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 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.12","@itwin/core-bentley":"workspace:^4.3.0-dev.12","@itwin/core-common":"workspace:^4.3.0-dev.12","@itwin/core-geometry":"workspace:^4.3.0-dev.12","@itwin/core-orbitgt":"workspace:^4.3.0-dev.12","@itwin/core-quantity":"workspace:^4.3.0-dev.12"},"//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"}}');
|
|
300126
300189
|
|
|
300127
300190
|
/***/ }),
|
|
300128
300191
|
|