@itwin/rpcinterface-full-stack-tests 4.0.0-dev.39 → 4.0.0-dev.40

package/lib/dist/_d48c.bundled-tests.js.map

@@ -1 +1 @@
-{"version":3,"file":"_d48c.bundled-tests.js","mappings":";;;;;;;;AAAA","sources":["file:///ignored|D:\\vsts_a\\10\\s\\common\\temp\\node_modules\\.pnpm\\@loaders.gl+worker-utils@3.3.1\\node_modules\\@loaders.gl\\worker-utils\\dist\\esm\\lib\\library-utils|../node/require-utils.node"],"names":[],"sourceRoot":""}
+{"version":3,"file":"_d48c.bundled-tests.js","mappings":";;;;;;;;AAAA","sources":["file:///ignored|D:\\vsts_b\\57\\s\\common\\temp\\node_modules\\.pnpm\\@loaders.gl+worker-utils@3.3.1\\node_modules\\@loaders.gl\\worker-utils\\dist\\esm\\lib\\library-utils|../node/require-utils.node"],"names":[],"sourceRoot":""}

package/lib/dist/bundled-tests.js

@@ -175366,8 +175366,8 @@ class Geometry {
         return (Math.abs(a) <= Geometry.smallMetricDistanceSquared) ? undefined : 1.0 / a;
     }
     /**
-     * Boolean test for metric coordinate near-equality. If tolerance is not passed, `Geometry.smallMetricDistance`
-     * is used as tolerance.
+     * Boolean test for metric coordinate near-equality (i.e., if x and y are almost equal). If tolerance is not passed,
+     * `Geometry.smallMetricDistance` is used as tolerance.
      */
     static isSameCoordinate(x, y, tol) {
         if (tol)
@@ -175565,7 +175565,8 @@ class Geometry {
             q = c;
         return q;
     }
-    /** Examine the value (particularly sign) of x.
+    /**
+     * Examine the value (particularly sign) of x.
      * * If x is negative, return outNegative.
      * * If x is true zero, return outZero
      * * If x is positive, return outPositive
@@ -175806,7 +175807,7 @@ class Geometry {
     /** return 0 if the value is undefined, 1 if defined. */
     static defined01(value) { return value === undefined ? 0 : 1; }
     /**
-     * Return `numerator` over `denominator` or `undefined`.
+     * Return `numerator` divided by `denominator`, or `undefined`.
      * @param numerator the numerator
      * @param denominator the denominator
      * @returns return `numerator/denominator` but if the ratio would exceed `Geometry.largeFractionResult`,
@@ -175818,7 +175819,7 @@ class Geometry {
         return undefined;
     }
     /**
-     * Return `numerator` over `denominator`.
+     * Return `numerator` divided by `denominator`.
      * @param numerator the numerator
      * @param denominator the denominator
      * @returns return `numerator/denominator` but if the ratio would exceed `Geometry.largeFractionResult`,
@@ -175831,7 +175832,7 @@ class Geometry {
         return defaultResult;
     }
     /**
-     * Return `numerator` over `denominator` (with a given `largestResult`) or `undefined`.
+     * Return `numerator` divided by `denominator` (with a given `largestResult`), or `undefined`.
      * @param numerator the numerator
      * @param denominator the denominator
      * @param largestResult the ratio threshold.
@@ -210899,7 +210900,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /* eslint-disable @itwin/prefer-get */
-// cSpell:words XXYZ YXYZ ZXYZ SaeedTorabi arctan newcommand
+// cSpell:words XXYZ YXYZ ZXYZ SaeedTorabi arctan newcommand diagonalization
 /**
  * PackedMatrix3dOps contains static methods for matrix operations where the matrix is a Float64Array.
  * * The Float64Array contains the matrix entries in row-major order
@@ -211552,7 +211553,14 @@ class Matrix3d {
         }
         return Matrix3d.createIdentity(result);
     }
-    /** Return the matrix for rotation of `angle` around desired `axis` */
+    /**
+     * Return the matrix for rotation of `angle` around desired `axis`
+     * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/CubeRotationAroundAnAxis
+     * @param axis the axis of rotation
+     * @param angle the angle of rotation
+     * @param result caller-allocated matrix (optional)
+     * @returns the `rotation matrix` or `undefined` (if axis magnitude is near zero).
+     */
     static createRotationAroundVector(axis, angle, result) {
         // Rodriguez formula (matrix form), https://mathworld.wolfram.com/RodriguesRotationFormula.html
         const c = angle.cos();
@@ -211768,63 +211776,143 @@ class Matrix3d {
         return result;
     }
     /**
-     * Apply (in place) a jacobi update that zeros out this.at(i,j).
+     * Apply (in place) a jacobi eigenvalue algorithm.
      * @param i row index of zeroed member
      * @param j column index of zeroed member
-     * @param k other row/column index (different from i and j)
-     * @param leftEigenVectors a matrix that its columns will be filled by eigenvectors of this Matrix3d
-     * (allocated by caller, computed and filled by this function)
+     * @param leftEigenvectors a matrix that its columns will be filled by the left eigenvectors of `this` Matrix3d
+     * (allocated by caller, computed and filled by this function). Note that columns of leftEigenVectors will be
+     * mutually perpendicular because `this` matrix is symmetric.
+     * @param lambda a matrix that its diagonal entries will be filled by eigenvalues and its non-diagonal elements
+     * converge to 0 (allocated by caller, computed and filled by this function).
+     */
+    applySymmetricJacobi(i, j, leftEigenvectors, lambda) {
+        const sii = lambda.at(i, i);
+        const sjj = lambda.at(j, j);
+        const sij = lambda.at(i, j);
+        if (Math.abs(sij) < 1.0e-15 * (sii + sjj))
+            return 0.0;
+        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
+        const c = jacobi.c;
+        const s = jacobi.s;
+        /**
+         * The following check does not exist in applyFastSymmetricJacobi because here if we don't return
+         * early, the matrix remains untouched. However, applyFastSymmetricJacobi zeroes-out elements ij
+         * and ji. Therefore, if we return early in applyFastSymmetricJacobi, zeroing-out wont happen.
+         */
+        if (Math.abs(s) < 2.0e-15)
+            return 0.0;
+        /**
+         * If you apply the following 2 lines to a symmetric matrix, you get same lines used in
+         * applyFastSymmetricJacobi. There are 2 differences which make applyFastSymmetricJacobi
+         * more efficient. First, we directly set elements ij and ji equal to zero rather than
+         * calculation them. Second, we copy symmetric elements from upper triangle to lower
+         * instead of calculating them.
+         */
+        lambda.applyGivensRowOp(i, j, c, s);
+        lambda.applyGivensColumnOp(i, j, c, s);
+        leftEigenvectors.applyGivensColumnOp(i, j, c, s);
+        return Math.abs(sij);
+    }
+    /**
+     * Factor `this` matrix as a product `U * lambda * UT` where `U` is an orthogonal matrix and `lambda`
+     * is a diagonal matrix.
+     *
+     * * **Note 1:** You must apply this function to a `symmetric` matrix. Otherwise, the lower triangle is ignored
+     * and the upper triangle is mirrored to the lower triangle to enforce symmetry.
+     * * **Note 2:** This function is replaced by a faster method called `fastSymmetricEigenvalues` so consider
+     * using the fast version instead.
+     * @param leftEigenvectors a matrix that its columns will be filled by the left eigenvectors of `this` Matrix3d
+     * (allocated by caller, computed and filled by this function). Note that columns of leftEigenVectors will be
+     * mutually perpendicular because `this` matrix is symmetric.
+     * @param lambda a vector that its entries will be filled by eigenvalues of `this` Matrix3d (allocated by
+     * caller, computed and filled by this function).
+     */
+    symmetricEigenvalues(leftEigenvectors, lambda) {
+        const matrix = this.clone();
+        leftEigenvectors.setIdentity();
+        matrix.coffs[3] = matrix.coffs[1];
+        matrix.coffs[6] = matrix.coffs[2];
+        matrix.coffs[7] = matrix.coffs[5];
+        const tolerance = 1.0e-12 * this.sumSquares();
+        const numberOfIterations = 7;
+        for (let iteration = 0; iteration < numberOfIterations; iteration++) {
+            const sum = this.applySymmetricJacobi(0, 1, leftEigenvectors, matrix)
+                + this.applySymmetricJacobi(0, 2, leftEigenvectors, matrix)
+                + this.applySymmetricJacobi(1, 2, leftEigenvectors, matrix);
+            if (sum < tolerance) {
+                lambda.set(matrix.at(0, 0), matrix.at(1, 1), matrix.at(2, 2));
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Apply (in place) a jacobi eigenvalue algorithm that diagonalize `this` matrix, i.e., zeros out this.at(i,j).
+     * * During diagonalization, the upper triangle is mirrored to lower triangle to enforce symmetry.
+     * * Math details can be found at docs/learning/geometry/Matrix.md
+     * @param i row index of zeroed member.
+     * @param j column index of zeroed member.
+     * @param k other row/column index (different from i and j).
+     * @param leftEigenVectors a matrix that its columns will be filled by the left eigenvectors of `this` Matrix3d
+     * (allocated by caller, computed and filled by this function). Note that columns of leftEigenVectors will be
+     * mutually perpendicular because `this` matrix is symmetric.
      */
-    applyFastSymmetricJacobiUpdate(i, j, k, leftEigenVectors) {
+    applyFastSymmetricJacobi(i, j, k, leftEigenVectors) {
         const indexII = 4 * i;
         const indexJJ = 4 * j;
         const indexIJ = 3 * i + j;
+        const indexJI = 3 * j + i;
         const indexIK = 3 * i + k;
+        const indexKI = 3 * k + i;
         const indexJK = 3 * j + k;
-        const dotUU = this.coffs[indexII];
-        const dotVV = this.coffs[indexJJ];
-        const dotUV = this.coffs[indexIJ];
-        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(dotUU - dotVV, 2.0 * dotUV);
-        if (Math.abs(dotUV) < 1.0e-15 * (dotUU + dotVV))
+        const indexKJ = 3 * k + j;
+        const sii = this.coffs[indexII];
+        const sjj = this.coffs[indexJJ];
+        const sij = this.coffs[indexIJ];
+        if (Math.abs(sij) < 1.0e-15 * (sii + sjj))
             return 0.0;
+        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
         const c = jacobi.c;
         const s = jacobi.s;
         const cc = c * c;
         const ss = s * s;
         const sc2 = 2.0 * c * s;
-        this.coffs[indexII] = cc * dotUU + sc2 * dotUV + ss * dotVV;
-        this.coffs[indexJJ] = ss * dotUU - sc2 * dotUV + cc * dotVV;
+        this.coffs[indexII] = cc * sii + sc2 * sij + ss * sjj;
+        this.coffs[indexJJ] = ss * sii - sc2 * sij + cc * sjj;
         this.coffs[indexIJ] = 0.0;
+        this.coffs[indexJI] = 0.0;
         const a = this.coffs[indexIK];
         const b = this.coffs[indexJK];
-        this.coffs[indexIK] = a * c + b * s;
+        this.coffs[indexIK] = c * a + s * b;
         this.coffs[indexJK] = -s * a + c * b;
-        this.coffs[3 * j + i] = 0.0;
-        this.coffs[3 * k + i] = this.coffs[indexIK];
-        this.coffs[3 * k + j] = this.coffs[indexJK];
+        this.coffs[indexKI] = this.coffs[indexIK];
+        this.coffs[indexKJ] = this.coffs[indexJK];
         leftEigenVectors.applyGivensColumnOp(i, j, c, s);
-        return Math.abs(dotUV);
+        return Math.abs(sij);
     }
     /**
-     * Factor this (symmetrized) as a product U * lambda * UT where U is orthogonal, lambda is diagonal.
-     * The upper triangle is mirrored to lower triangle to enforce symmetry.
-     * @param leftEigenvectors a matrix that its columns will be filled by eigenvectors of this Matrix3d
-     * (allocated by caller, computed and filled by this function)
-     * @param lambda a vector that its entries will be filled by eigenvalues of this Matrix3d
-     * (allocated by caller, computed and filled by this function)
+     * Factor `this` matrix as a product `U * lambda * UT` where `U` is an orthogonal matrix and `lambda`
+     * is a diagonal matrix.
+     *
+     * * **Note:** You must apply this function to a `symmetric` matrix. Otherwise, the lower triangle is ignored
+     * and the upper triangle is mirrored to the lower triangle to enforce symmetry.
+     * * Math details can be found at docs/learning/geometry/Matrix.md
+     * @param leftEigenvectors a matrix that its columns will be filled by the left eigenvectors of `this` Matrix3d
+     * (allocated by caller, computed and filled by this function). Note that columns of leftEigenVectors will be
+     * mutually perpendicular because `this` matrix is symmetric.
+     * @param lambda a vector that its entries will be filled by eigenvalues of `this` Matrix3d (allocated by
+     * caller, computed and filled by this function).
      */
     fastSymmetricEigenvalues(leftEigenvectors, lambda) {
         const matrix = this.clone();
         leftEigenvectors.setIdentity();
         const tolerance = 1.0e-12 * this.sumSquares();
-        for (let iteration = 0; iteration < 7; iteration++) {
-            const sum = matrix.applyFastSymmetricJacobiUpdate(0, 1, 2, leftEigenvectors)
-                + matrix.applyFastSymmetricJacobiUpdate(0, 2, 1, leftEigenvectors)
-                + matrix.applyFastSymmetricJacobiUpdate(1, 2, 0, leftEigenvectors);
-            // console.log("symmetric sum", sum);
-            // console.log ("sum", sum);
+        const numberOfIterations = 7;
+        for (let iteration = 0; iteration < numberOfIterations; iteration++) {
+            const sum = matrix.applyFastSymmetricJacobi(0, 1, 2, leftEigenvectors)
+                + matrix.applyFastSymmetricJacobi(0, 2, 1, leftEigenvectors)
+                + matrix.applyFastSymmetricJacobi(1, 2, 0, leftEigenvectors);
             if (sum < tolerance) {
-                // console.log("symmetric iterations", iteration);
                 lambda.set(matrix.at(0, 0), matrix.at(1, 1), matrix.at(2, 2));
                 return true;
             }
@@ -211832,8 +211920,8 @@ class Matrix3d {
         return false;
     }
     /**
-     * Compute the (unit vector) axis and angle of rotation.
-     * * math details can be found at docs/learning/geometry/Angle.md
+     * Compute the (unit vector) axis and angle for the rotation generated by `this` Matrix3d.
+     * * Math details can be found at docs/learning/geometry/Angle.md
      * @returns Returns axis and angle of rotation with result.ok === true when the conversion succeeded.
      */
     getAxisAndAngleOfRotation() {
@@ -211859,7 +211947,7 @@ class Matrix3d {
              *                                 2x^2-1  2xy      2xz
              *                                 2xy     2y^2-1   2yz
              *                                 2xz     2yz      2z^2-1
-             * Note that the matrix is symmetric.
+             * Note that the matrix is "symmetric".
              * If rotation is around one the standard basis then non-diagonal entries become 0 and we
              * have one 1 and two -1s on the diagonal.
              * If rotation is around an axis other than standard basis, then the axis is the eigenvector
@@ -211881,7 +211969,7 @@ class Matrix3d {
             // Look for eigenvector with eigenvalue = 1
             const eigenvectors = Matrix3d.createIdentity();
             const eigenvalues = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 0);
-            if (this.fastSymmetricEigenvalues(eigenvectors, eigenvalues)) {
+            if (this.fastSymmetricEigenvalues(eigenvectors, eigenvalues)) { // note: this matrix is "symmetric"
                 for (let axisIndex = 0; axisIndex < 2; axisIndex++) {
                     const lambda = eigenvalues.at(axisIndex);
                     if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(1, lambda))
@@ -211902,53 +211990,67 @@ class Matrix3d {
         };
         return result;
     }
-    /** Rotate so columns i and j become perpendicular */
+    /**
+     * Rotate columns i and j of `this` matrix to make them perpendicular using the angle that zero-out
+     * `thisTranspose * this`.
+     * @param i row index of zeroed member.
+     * @param j column index of zeroed member.
+     * @param matrixU a matrix that its columns will be filled by the right eigenvectors of `thisTranspose * this`
+     * (allocated by caller, computed and filled by this function). Note that columns of matrixU will be mutually
+     *  perpendicular because `thisTranspose * this` matrix is symmetric.
+     */
     applyJacobiColumnRotation(i, j, matrixU) {
-        const uDotU = this.coffs[i] * this.coffs[i] + this.coffs[i + 3] * this.coffs[i + 3] + this.coffs[i + 6] * this.coffs[i + 6];
-        const vDotV = this.coffs[j] * this.coffs[j] + this.coffs[j + 3] * this.coffs[j + 3] + this.coffs[j + 6] * this.coffs[j + 6];
-        const uDotV = this.coffs[i] * this.coffs[j] + this.coffs[i + 3] * this.coffs[j + 3] + this.coffs[i + 6] * this.coffs[j + 6];
-        // const c2 = uDotU - vDotV;
-        // const s2 = 2.0 * uDotV;
+        const uDotU = this.coffs[i] * this.coffs[i]
+            + this.coffs[i + 3] * this.coffs[i + 3]
+            + this.coffs[i + 6] * this.coffs[i + 6];
+        const vDotV = this.coffs[j] * this.coffs[j]
+            + this.coffs[j + 3] * this.coffs[j + 3]
+            + this.coffs[j + 6] * this.coffs[j + 6];
+        const uDotV = this.coffs[i] * this.coffs[j]
+            + this.coffs[i + 3] * this.coffs[j + 3]
+            + this.coffs[i + 6] * this.coffs[j + 6];
         const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(uDotU - vDotV, 2.0 * uDotV);
-        // const h = Math.hypot(c2, s2);
-        // console.log(" c2 s2", c2 / h, s2 / h);
-        // console.log(" C S ", Math.cos(2 * jacobi.radians), Math.sin(2 * jacobi.radians));
-        // console.log("i j uDotV", i, j, uDotV);
-        if (Math.abs(jacobi.s) < 2.0e-15)
+        const c = jacobi.c;
+        const s = jacobi.s;
+        if (Math.abs(s) < 2.0e-15)
             return 0.0;
-        this.applyGivensColumnOp(i, j, jacobi.c, jacobi.s);
-        matrixU.applyGivensRowOp(i, j, jacobi.c, jacobi.s);
-        // const BTB = this.multiplyMatrixTransposeMatrix(this);
-        // console.log("BTB", BTB.at(0, 0), BTB.at(1, 1), BTB.at(2, 2), "       off", BTB.at(0, 1), BTB.at(0, 2), BTB.at(1, 2), "  at(i,j)", BTB.at(i, j));
+        this.applyGivensColumnOp(i, j, c, s); // make columns i and j of `this` matrix perpendicular
+        matrixU.applyGivensRowOp(i, j, c, s); // right eigenvalues of `thisTranspose * this`
         return Math.abs(uDotV);
     }
     /**
-     * Factor this as a product C * U where C has mutually perpendicular columns and
-     * U is orthogonal.
-     * @param matrixC (allocate by caller, computed here)
-     * @param matrixU (allocate by caller, computed here)
+     * Factor `this` matrix as a product `VD * U` where `VD` has mutually perpendicular columns and `U` is orthogonal.
+     * @param matrixVD a matrix that its columns will be filled by rotating columns of `this` to make them mutually
+     * perpendicular (allocated by caller, computed and filled by this function).
+     * @param matrixU a matrix that its columns will be filled by the right eigenvectors of `thisTranspose * this`
+     * (allocated by caller, computed and filled by this function). Note that columns of matrixU will be mutually
+     *  perpendicular because `thisTranspose * this` matrix is symmetric.
      */
-    factorPerpendicularColumns(matrixC, matrixU) {
-        matrixC.setFrom(this);
+    factorPerpendicularColumns(matrixVD, matrixU) {
+        matrixVD.setFrom(this);
         matrixU.setIdentity();
         const tolerance = 1.0e-12 * this.sumSquares();
-        for (let iteration = 0; iteration < 7; iteration++) {
-            const sum = matrixC.applyJacobiColumnRotation(0, 1, matrixU)
-                + matrixC.applyJacobiColumnRotation(0, 2, matrixU)
-                + matrixC.applyJacobiColumnRotation(1, 2, matrixU);
-            // console.log ("   sum", sum);
+        const numberOfIterations = 7;
+        for (let iteration = 0; iteration < numberOfIterations; iteration++) {
+            const sum = matrixVD.applyJacobiColumnRotation(0, 1, matrixU)
+                + matrixVD.applyJacobiColumnRotation(0, 2, matrixU)
+                + matrixVD.applyJacobiColumnRotation(1, 2, matrixU);
             if (sum < tolerance) {
-                // console.log("jacobi iterations", iteration);
                 return true;
             }
         }
         return false;
     }
     /**
-     * Factor this matrix M as a product M = V * D * U where V and U are orthogonal, and D is diagonal (scale matrix).
-     * @param matrixV left orthogonal factor (allocate by caller, computed here)
-     * @param scale diagonal entries of D (allocate by caller, computed here)
-     * @param matrixU right orthogonal factor (allocate by caller, computed here)
+     * Factor `this` matrix as a product `V * D * U` where `V` and `U` are orthogonal and `D` is diagonal with
+     * positive entries.
+     * * This is formally known as the `Singular Value Decomposition` or `SVD`.
+     * @param matrixV an orthogonal matrix that its columns will be filled by the left eigenvectors of
+     * `thisTranspose * this` (allocated by caller, computed and filled by this function).
+     * @param scale singular values of `this` (allocated by caller, computed and filled by this function).
+     * The singular values in the `scale` are non-negative and decreasing.
+     * @param matrixU an orthogonal matrix that its columns will be filled by the right eigenvectors of
+     * `thisTranspose * this` (allocated by caller, computed and filled by this function).
      */
     factorOrthogonalScaleOrthogonal(matrixV, scale, matrixU) {
         const matrixVD = Matrix3d.createZero();
@@ -211958,7 +212060,7 @@ class Matrix3d {
         column.push(matrixVD.getColumn(0));
         column.push(matrixVD.getColumn(1));
         column.push(matrixVD.getColumn(2));
-        scale.set(column[0].magnitude(), column[1].magnitude(), column[2].magnitude());
+        scale.set(column[0].magnitude(), column[1].magnitude(), column[2].magnitude()); // singular values of `this`
         const det = matrixVD.determinant();
         if (det < 0)
             scale.z = -scale.z;
@@ -211966,7 +212068,7 @@ class Matrix3d {
         const scaleXIsZero = Math.abs(scale.x) < almostZero;
         const scaleYIsZero = Math.abs(scale.y) < almostZero;
         const scaleZIsZero = Math.abs(scale.z) < almostZero;
-        // ASSUME: any zero-magnitude column(s) of matrixVD are last
+        // NOTE: We assume any zero-magnitude column(s) of matrixVD are last
         if (!scaleXIsZero && !scaleYIsZero && !scaleZIsZero) { // full rank
             matrixV = matrixVD.scaleColumns(1 / scale.x, 1 / scale.y, 1 / scale.z, matrixV);
         }
@@ -211984,59 +212086,6 @@ class Matrix3d {
         }
         return true;
     }
-    /** Apply a jacobi step to lambda which evolves towards diagonal. */
-    applySymmetricJacobi(i, j, lambda) {
-        const uDotU = lambda.at(i, i);
-        const vDotV = lambda.at(j, j);
-        const uDotV = lambda.at(i, j);
-        if (Math.abs(uDotV) < 1.0e-15 * (uDotU + vDotV))
-            return 0.0;
-        // const c2 = uDotU - vDotV;
-        // const s2 = 2.0 * uDotV;
-        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(uDotU - vDotV, 2.0 * uDotV);
-        // const h = Math.hypot(c2, s2);
-        // console.log(" c2 s2", c2 / h, s2 / h);
-        // console.log(" C S ", Math.cos(2 * jacobi.radians), Math.sin(2 * jacobi.radians));
-        // console.log("i j uDotV", i, j, uDotV);
-        if (Math.abs(jacobi.s) < 2.0e-15)
-            return 0.0;
-        // Factored form is this *lambda * thisTranspose
-        // Let Q be the rotation matrix.  Q*QT is inserted, viz
-        //          this*Q * QT * lambda * Q*thisTranspose
-        this.applyGivensColumnOp(i, j, jacobi.c, jacobi.s);
-        lambda.applyGivensRowOp(i, j, jacobi.c, jacobi.s);
-        lambda.applyGivensColumnOp(i, j, jacobi.c, jacobi.s);
-        // const BTB = this.multiplyMatrixTransposeMatrix(this);
-        // console.log("BTB", BTB.at(0, 0), BTB.at(1, 1), BTB.at(2, 2), "       off", BTB.at(0, 1), BTB.at(0, 2), BTB.at(1, 2), "  at(i,j)", BTB.at(i, j));
-        return Math.abs(uDotV);
-    }
-    /**
-     * Factor this (symmetrized) as a product U * lambda * UT where U is orthogonal, lambda is diagonal.
-     * The upper triangle is mirrored to lower triangle to enforce symmetry.
-     * @param matrixC (allocate by caller, computed here)
-     * @param factor  (allocate by caller, computed here)
-     */
-    symmetricEigenvalues(leftEigenvectors, lambda) {
-        const matrix = this.clone();
-        leftEigenvectors.setIdentity();
-        matrix.coffs[3] = matrix.coffs[1];
-        matrix.coffs[6] = matrix.coffs[2];
-        matrix.coffs[7] = matrix.coffs[5];
-        const tolerance = 1.0e-12 * this.sumSquares();
-        for (let iteration = 0; iteration < 7; iteration++) {
-            const sum = leftEigenvectors.applySymmetricJacobi(0, 1, matrix)
-                + leftEigenvectors.applySymmetricJacobi(0, 2, matrix)
-                + leftEigenvectors.applySymmetricJacobi(1, 2, matrix);
-            // console.log("symmetric sum", sum);
-            // console.log ("   sum", sum);
-            if (sum < tolerance) {
-                // console.log("symmetric iterations", iteration);
-                lambda.set(matrix.at(0, 0), matrix.at(1, 1), matrix.at(2, 2));
-                return true;
-            }
-        }
-        return false;
-    }
     /**
      * Return a matrix that rotates a fraction of the angular sweep from vectorA to vectorB.
      * @param vectorA initial vector position
@@ -213134,8 +213183,7 @@ class Matrix3d {
         this.inverseState = InverseMatrixState.unknown;
     }
     /**
-     * Create a rigid matrix (columns and rows are unit length and pairwise perpendicular) for
-     * the given eye coordinate.
+     * Create a rigid matrix (columns and rows are unit length and pairwise perpendicular) for the given eye coordinate.
      * * column 2 is parallel to (x,y,z).
      * * column 0 is perpendicular to column 2 and is in the xy plane.
      * * column 1 is perpendicular to both. It is the "up" vector on the view plane.
@@ -213168,7 +213216,8 @@ class Matrix3d {
              *
              * This is an orthogonal matrix meaning it rotates the standard XYZ axis to ABC axis system
              * (if matrix is [A B C]). The matrix rotates (0,0,1), i.e., the default Top view or Z axis,
-             *  to the eye point (x/r,y/r,z/r). The matrix also rotates (1,0,0) to a point on XY plane.
+             * to the eye point (x/r,y/r,z/r) where r = sqrt(x*x + y*y + z*z). The matrix also rotates
+             * (1,0,0) to a point on XY plane.
              */
             const c = x / rxy;
             const s = y / rxy;
@@ -213248,6 +213297,15 @@ class Matrix3d {
         const sumOff = Math.abs(sumAll - sumDiagonal);
         return Math.sqrt(sumOff) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(sumAll));
     }
+    /** Sum of squared differences between symmetric pairs (symmetric pairs have indices (1,3), (2,6), and (5,7).) */
+    sumSkewSquares() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1] - this.coffs[3], this.coffs[2] - this.coffs[6], this.coffs[5] - this.coffs[7]);
+    }
+    /** Test if the matrix is (very near to) symmetric */
+    isSymmetric() {
+        const offDiagonal = this.sumSkewSquares();
+        return Math.sqrt(offDiagonal) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(this.sumSquares()));
+    }
     /** Test if the stored inverse is present and marked valid */
     get hasCachedInverse() {
         return this.inverseState === InverseMatrixState.inverseStored && this.inverseCoffs !== undefined;
@@ -213261,7 +213319,7 @@ class Matrix3d {
     /** Test if the above diagonal entries (1,2,5) are all nearly zero */
     get isLowerTriangular() {
         const sumAll = this.sumSquares();
-        const sumLow = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1], this.coffs[2], this.coffs[75]);
+        const sumLow = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1], this.coffs[2], this.coffs[5]);
         return Math.sqrt(sumLow) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(sumAll));
     }
     /**
@@ -213278,10 +213336,6 @@ class Matrix3d {
             return this.coffs[0];
         return undefined;
     }
-    /** Sum of squared differences between symmetric pairs (entry 1 and 3 - 2 and 6 - 5 and 7) */
-    sumSkewSquares() {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1] - this.coffs[3], this.coffs[2] - this.coffs[6], this.coffs[5] - this.coffs[7]);
-    }
     /**
      * Test if all rows and columns are unit length and are perpendicular to each other, i.e., the matrix is either
      * a `pure rotation` (determinant is +1) or is a `mirror` (determinant is -1).
@@ -213585,6 +213639,7 @@ class OrderedRotationAngles {
      * For example XYZ means to rotate around x axis first, then y axis, and finally Z axis.
      * * Note that rotation order is reverse of rotation matrix multiplication so for XYZ the rotation
      * matrix multiplication would be zRot*yRot*xRot
+     * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/CubeRotationAroundStandardAxes
      * @param xyzRotationIsClockwise the flags controlling whether direction of x,y,z is clockwise or counterclockwise.
      * rotation direction of x,y,z: true ---> clockwise - false ---> counterclockwise.
      * * if xyzRotationIsClockwise is undefined it's set to [false, false, false].
@@ -280029,7 +280084,7 @@ class TestContext {
         this.initializeRpcInterfaces({ title: this.settings.Backend.name, version: this.settings.Backend.version });
         const iModelClient = new imodels_client_management_1.IModelsClient({ api: { baseUrl: `https://${process.env.IMJS_URL_PREFIX ?? ""}api.bentley.com/imodels` } });
         await core_frontend_1.NoRenderApp.startup({
-            applicationVersion: "4.0.0-dev.39",
+            applicationVersion: "4.0.0-dev.40",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -299585,7 +299640,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.0.0-dev.39","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","build:ci":"npm run -s build && npm run -s build:esm","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","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/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 --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-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"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/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.0.0-dev.39","@itwin/core-bentley":"workspace:^4.0.0-dev.39","@itwin/core-common":"workspace:^4.0.0-dev.39","@itwin/core-geometry":"workspace:^4.0.0-dev.39","@itwin/core-orbitgt":"workspace:^4.0.0-dev.39","@itwin/core-quantity":"workspace:^4.0.0-dev.39"},"//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":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//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/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.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","deep-assign":"^2.0.0","fuse.js":"^3.3.0","qs":"^6.5.3","semver":"^7.3.5","superagent":"^7.1.5","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.0.0-dev.40","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","build:ci":"npm run -s build && npm run -s build:esm","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","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/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 --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-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"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/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.0.0-dev.40","@itwin/core-bentley":"workspace:^4.0.0-dev.40","@itwin/core-common":"workspace:^4.0.0-dev.40","@itwin/core-geometry":"workspace:^4.0.0-dev.40","@itwin/core-orbitgt":"workspace:^4.0.0-dev.40","@itwin/core-quantity":"workspace:^4.0.0-dev.40"},"//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":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//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/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.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","deep-assign":"^2.0.0","fuse.js":"^3.3.0","qs":"^6.5.3","semver":"^7.3.5","superagent":"^7.1.5","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ }),