@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/numerics/TriDiagonalSystem.js

@@ -0,0 +1,270 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Numerics
+ */
+import { Geometry } from "../Geometry";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class
+var DataState;
+(function (DataState) {
+    DataState[DataState["RawMatrix"] = 0] = "RawMatrix";
+    DataState[DataState["FactorOK"] = 1] = "FactorOK";
+    DataState[DataState["FactorFailed"] = 2] = "FactorFailed";
+})(DataState || (DataState = {}));
+/**
+ * Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors
+ * @internal
+ */
+export class TriDiagonalSystem {
+    constructor(n) {
+        this._aLeft = new Float64Array(n);
+        this._aDiag = new Float64Array(n);
+        this._aRight = new Float64Array(n);
+        this._b = new Float64Array(n);
+        this._x = new Float64Array(n);
+        this.reset();
+    }
+    /** Reset to RawMatrix state with all coefficients zero */
+    reset() {
+        this._dataState = DataState.RawMatrix;
+        const n = this._aDiag.length;
+        for (let i = 0; i < n; i++) {
+            this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;
+        }
+    }
+    /** Install data in a row of the matrix */
+    setRow(row, left, diag, right) {
+        this._aLeft[row] = left;
+        this._aDiag[row] = diag;
+        this._aRight[row] = right;
+    }
+    /** Add to row of matrix */
+    addToRow(row, left, diag, right) {
+        this._aLeft[row] += left;
+        this._aDiag[row] += diag;
+        this._aRight[row] += right;
+    }
+    /** Install data in the right side (B) vector */
+    setB(row, bb) {
+        this._b[row] = bb;
+    }
+    /** Add to an entry in the right side (B) vector */
+    addToB(row, bb) {
+        this._b[row] += bb;
+    }
+    /** Access data from the right side (B) vector */
+    getB(row) {
+        return this._b[row];
+    }
+    /** Install data in the solution (X) vector */
+    setX(row, xx) {
+        this._x[row] = xx;
+    }
+    /** Access data from the solution (X) vector */
+    getX(row) {
+        return this._x[row];
+    }
+    /** Get method for matrix and vector order */
+    order() {
+        return this._aDiag.length;
+    }
+    /** Compute product of AX and save as B */
+    multiplyAX() {
+        if (this._dataState === DataState.FactorFailed) {
+            return false;
+        }
+        else if (this._dataState === DataState.FactorOK) {
+            const n = this._aDiag.length;
+            const nm1 = n - 1;
+            for (let i = 0; i < nm1; i++) {
+                this._b[i] = this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];
+            }
+            this._b[nm1] = this._aDiag[nm1] * this._x[nm1];
+            for (let i = nm1; i > 0; i--) {
+                this._b[i] += this._aLeft[i] * this._b[i - 1];
+            }
+            return true;
+        }
+        else {
+            const n = this._aDiag.length;
+            const nm1 = n - 1;
+            this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];
+            let i;
+            for (i = 1; i < nm1; i++) {
+                this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];
+            }
+            this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];
+            return true;
+        }
+    }
+    /** Compute product of AX and save as B */
+    multiplyAXPoints(pointX, pointB) {
+        pointB.length = 0;
+        while (pointB.length < pointX.length)
+            pointB.push(Point3d.create());
+        pointB.length = pointX.length;
+        if (this._dataState === DataState.FactorFailed) {
+            return false;
+        }
+        else if (this._dataState === DataState.FactorOK) {
+            const n = this._aDiag.length;
+            const nm1 = n - 1;
+            for (let i = 0; i < nm1; i++) {
+                Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);
+            }
+            Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);
+            for (let i = nm1; i > 0; i--) {
+                pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);
+            }
+            return true;
+        }
+        else {
+            const n = this._aDiag.length;
+            const nm1 = n - 1;
+            Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);
+            let i;
+            for (i = 1; i < nm1; i++) {
+                Point3d.createAdd3Scaled(pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);
+            }
+            Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);
+            return true;
+        }
+    }
+    /** Multiply the stored factors together to return to plain matrix form */
+    defactor() {
+        if (this._dataState === DataState.RawMatrix) {
+            return true;
+        }
+        if (this._dataState === DataState.FactorFailed) {
+            return false;
+        }
+        const n = this._aDiag.length;
+        const nm1 = n - 1;
+        for (let i = nm1; i > 0; i--) {
+            this._aDiag[i] += this._aLeft[i] * this._aRight[i - 1];
+            this._aLeft[i] *= this._aDiag[i - 1];
+        }
+        this._dataState = DataState.RawMatrix;
+        return true;
+    }
+    /** Factor the tridiagonal matrix to LU parts. b, x, not altered */
+    factor() {
+        if (this._dataState === DataState.FactorOK) {
+            return true;
+        }
+        if (this._dataState !== DataState.RawMatrix) {
+            return false;
+        }
+        this._dataState = DataState.FactorFailed;
+        const n1 = this._aDiag.length - 1; // Last pivot index
+        // Eliminate in subdiagonal.
+        for (let i = 0; i < n1; i++) {
+            const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);
+            if (r === undefined)
+                return false;
+            this._aLeft[i + 1] = r;
+            this._aDiag[i + 1] -= r * this._aRight[i];
+        }
+        this._dataState = DataState.FactorOK;
+        return true;
+    }
+    /** Solve AX=B. A is left in factored state. B unchanged. */
+    factorAndBackSubstitute() {
+        const n = this._aDiag.length;
+        const n1 = n - 1;
+        if (!this.factor())
+            return false;
+        // Apply L inverse to B, same sequence as was done to A:
+        for (let i = 0; i < n; i++) {
+            this._x[i] = this._b[i];
+        }
+        for (let i = 1; i < n; i++) {
+            this._x[i] -= this._aLeft[i] * this._x[i - 1];
+        }
+        // Print ("LU  L Inverse B B");
+        // overwrite X with solution of U * X = L inverse B, where RHS is already in X...
+        // All diagonals are known to be nonzero. Really.  Really???
+        this._x[n1] /= this._aDiag[n1];
+        for (let i = n1 - 1; i >= 0; i--) {
+            this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];
+        }
+        return true;
+    }
+    /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array */
+    factorAndBackSubstitutePointArrays(vectorB, vectorX) {
+        const n = this._aDiag.length;
+        if (vectorB.length < n)
+            return false;
+        while (vectorX.length < n)
+            vectorX.push(Point3d.create(0, 0, 0));
+        vectorX.length = n;
+        const n1 = n - 1;
+        if (!this.factor())
+            return false;
+        // Apply L inverse to B, same sequence as was done to A:
+        if (vectorB !== vectorX) {
+            for (let i = 0; i < n; i++) {
+                vectorX[i].setFrom(vectorB[i]);
+            }
+        }
+        let a;
+        let b;
+        for (let i = 1; i < n; i++) {
+            a = this._aLeft[i];
+            vectorX[i].x -= a * vectorX[i - 1].x;
+            vectorX[i].y -= a * vectorX[i - 1].y;
+            vectorX[i].z -= a * vectorX[i - 1].z;
+        }
+        // Print ("LU  L inverse B");
+        // overwrite X with solution of U * X = L inverse B, where RHS is already in X...
+        // All diagonals are known to be nonzero. Really.  Really???
+        b = 1.0 / this._aDiag[n1];
+        vectorX[n1].x *= b;
+        vectorX[n1].y *= b;
+        vectorX[n1].z *= b;
+        for (let i = n1 - 1; i >= 0; i--) {
+            a = this._aRight[i];
+            b = 1.0 / this._aDiag[i];
+            vectorX[i].x = (vectorX[i].x - a * vectorX[i + 1].x) * b;
+            vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;
+            vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;
+        }
+        return true;
+    }
+    /** Allocate a complete copy */
+    copy() {
+        const n = this._aDiag.length;
+        const B = new TriDiagonalSystem(n);
+        for (let i = 0; i < n; i++) {
+            B._aLeft[i] = this._aLeft[i];
+            B._aDiag[i] = this._aDiag[i];
+            B._aRight[i] = this._aRight[i];
+            B._x[i] = this._x[i];
+            B._b[i] = this._b[i];
+        }
+        B._dataState = this._dataState;
+        return B;
+    }
+    /** return an array form that may be useful for display ... */
+    flatten() {
+        const n = this._aDiag.length;
+        const data = [];
+        for (let i = 0; i < n; i++) {
+            data.push([i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);
+        }
+        return data;
+    }
+    /** return an array form that may be useful for display ... */
+    flattenWithPoints(xyzB) {
+        const n = this._aDiag.length;
+        const data = [];
+        for (let i = 0; i < n; i++) {
+            data.push([i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);
+        }
+        return data;
+    }
+}
+//# sourceMappingURL=TriDiagonalSystem.js.map

package/lib/esm/numerics/TriDiagonalSystem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TriDiagonalSystem.js","sourceRoot":"","sources":["../../../src/numerics/TriDiagonalSystem.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,kGAAkG;AAClG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACZ,mDAAS,CAAA;IACT,iDAAQ,CAAA;IACR,yDAAY,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AACD;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IAe5B,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,0DAA0D;IACnD,KAAK;QACV,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;SACnF;IACH,CAAC;IACD,0CAA0C;IACnC,MAAM,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;IAC7B,CAAC;IACD,gDAAgD;IACzC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,MAAM,CAAC,GAAW,EAAE,EAAU;QACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IACD,iDAAiD;IAC1C,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,6CAA6C;IACtC,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD,0CAA0C;IACnC,UAAU;QACf,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE;YAC9C,OAAO,KAAK,CAAC;SACd;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE;YACjD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC5B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;aAC7E;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC5B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;aAC/C;YAED,OAAO,IAAI,CAAC;SACb;aAAM;YACL,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBACxB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;aAC/G;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjF,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED,0CAA0C;IACnC,gBAAgB,CAAC,MAAiB,EAAE,MAAiB;QAC1D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;YAClC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE9B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE;YAC9C,OAAO,KAAK,CAAC;SACd;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE;YAEjD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC5B,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aAChG;YACD,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC5B,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aAChE;YAED,OAAO,IAAI,CAAC;SACb;aAAM;YACL,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBACxB,OAAO,CAAC,gBAAgB,CACtB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EACxD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aACd;YACD,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACtG,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED,0EAA0E;IACnE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE;YAC3C,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE;YAC9C,OAAO,KAAK,CAAC;SACd;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE;YAC1C,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE;YAC3C,OAAO,KAAK,CAAC;SACd;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,YAAY,CAAC;QAEzC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,mBAAmB;QACzD,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,KAAK,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC3C;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4DAA4D;IACrD,uBAAuB;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SAC/C;QAED,+BAA+B;QAC/B,iFAAiF;QACjF,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC/E;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC/F,kCAAkC,CAAC,OAAkB,EAAE,OAAkB;QAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,OAAO,KAAK,CAAC;QAEf,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,IAAI,OAAO,KAAK,OAAO,EAAE;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;aAChC;SACF;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SACtC;QAED,6BAA6B;QAC7B,iFAAiF;QACjF,4DAA4D;QAC5D,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAChC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC1D;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+BAA+B;IACxB,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACtB;QACD,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8DAA8D;IACvD,OAAO;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IACvD,iBAAiB,CAAC,IAAe;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;SACzF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class\r\nenum DataState {\r\n  RawMatrix,\r\n  FactorOK,\r\n  FactorFailed,\r\n}\r\n/**\r\n * Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors\r\n * @internal\r\n */\r\nexport class TriDiagonalSystem {\r\n\r\n  // Lower diagonal, indexed by rows\r\n  private _aLeft: Float64Array;\r\n  // Upper diagonal, indexed by rows\r\n  private _aRight: Float64Array;\r\n  // Main diagonal, indexed by rows\r\n  private _aDiag: Float64Array;\r\n  // Right side vector\r\n  private _b: Float64Array;\r\n  // Solution vector\r\n  private _x: Float64Array;\r\n\r\n  private _dataState!: DataState;\r\n\r\n  constructor(n: number) {\r\n    this._aLeft = new Float64Array(n);\r\n    this._aDiag = new Float64Array(n);\r\n    this._aRight = new Float64Array(n);\r\n    this._b = new Float64Array(n);\r\n    this._x = new Float64Array(n);\r\n    this.reset();\r\n  }\r\n\r\n  /** Reset to RawMatrix state with all coefficients zero */\r\n  public reset() {\r\n    this._dataState = DataState.RawMatrix;\r\n    const n = this._aDiag.length;\r\n    for (let i = 0; i < n; i++) {\r\n      this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;\r\n    }\r\n  }\r\n  /** Install data in a row of the matrix */\r\n  public setRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] = left;\r\n    this._aDiag[row] = diag;\r\n    this._aRight[row] = right;\r\n  }\r\n  /** Add to row of matrix */\r\n  public addToRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] += left;\r\n    this._aDiag[row] += diag;\r\n    this._aRight[row] += right;\r\n  }\r\n  /** Install data in the right side (B) vector */\r\n  public setB(row: number, bb: number) {\r\n    this._b[row] = bb;\r\n  }\r\n  /** Add to an entry in the right side (B) vector */\r\n  public addToB(row: number, bb: number) {\r\n    this._b[row] += bb;\r\n  }\r\n  /** Access data from the right side (B) vector */\r\n  public getB(row: number): number {\r\n    return this._b[row];\r\n  }\r\n  /** Install data in the solution (X) vector */\r\n  public setX(row: number, xx: number) {\r\n    this._x[row] = xx;\r\n  }\r\n  /** Access data from the solution (X) vector */\r\n  public getX(row: number): number {\r\n    return this._x[row];\r\n  }\r\n  /** Get method for matrix and vector order */\r\n  public order(): number {\r\n    return this._aDiag.length;\r\n  }\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAX(): boolean {\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        this._b[i] = this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aDiag[nm1] * this._x[nm1];\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        this._b[i] += this._aLeft[i] * this._b[i - 1];\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAXPoints(pointX: Point3d[], pointB: Point3d[]): boolean {\r\n    pointB.length = 0;\r\n    while (pointB.length < pointX.length)\r\n      pointB.push(Point3d.create());\r\n    pointB.length = pointX.length;\r\n\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);\r\n      }\r\n      Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        Point3d.createAdd3Scaled(\r\n          pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i],\r\n          pointX[i + 1], this._aRight[i],\r\n          pointB[i]);\r\n      }\r\n      Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Multiply the stored factors together to return to plain matrix form */\r\n  public defactor(): boolean {\r\n    if (this._dataState === DataState.RawMatrix) {\r\n      return true;\r\n    }\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    }\r\n    const n = this._aDiag.length;\r\n    const nm1 = n - 1;\r\n\r\n    for (let i = nm1; i > 0; i--) {\r\n      this._aDiag[i] += this._aLeft[i] * this._aRight[i - 1];\r\n      this._aLeft[i] *= this._aDiag[i - 1];\r\n    }\r\n    this._dataState = DataState.RawMatrix;\r\n    return true;\r\n  }\r\n  /** Factor the tridiagonal matrix to LU parts. b, x, not altered */\r\n  public factor(): boolean {\r\n    if (this._dataState === DataState.FactorOK) {\r\n      return true;\r\n    }\r\n    if (this._dataState !== DataState.RawMatrix) {\r\n      return false;\r\n    }\r\n    this._dataState = DataState.FactorFailed;\r\n\r\n    const n1 = this._aDiag.length - 1;    // Last pivot index\r\n    // Eliminate in subdiagonal.\r\n    for (let i = 0; i < n1; i++) {\r\n      const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);\r\n      if (r === undefined)\r\n        return false;\r\n      this._aLeft[i + 1] = r;\r\n      this._aDiag[i + 1] -= r * this._aRight[i];\r\n    }\r\n    this._dataState = DataState.FactorOK;\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. */\r\n  public factorAndBackSubstitute(): boolean {\r\n    const n = this._aDiag.length;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    for (let i = 0; i < n; i++) {\r\n      this._x[i] = this._b[i];\r\n    }\r\n    for (let i = 1; i < n; i++) {\r\n      this._x[i] -= this._aLeft[i] * this._x[i - 1];\r\n    }\r\n\r\n    // Print (\"LU  L Inverse B B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    this._x[n1] /= this._aDiag[n1];\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array */\r\n  public factorAndBackSubstitutePointArrays(vectorB: Point3d[], vectorX: Point3d[]): boolean {\r\n    const n = this._aDiag.length;\r\n    if (vectorB.length < n)\r\n      return false;\r\n\r\n    while (vectorX.length < n)\r\n      vectorX.push(Point3d.create(0, 0, 0));\r\n    vectorX.length = n;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    if (vectorB !== vectorX) {\r\n      for (let i = 0; i < n; i++) {\r\n        vectorX[i].setFrom(vectorB[i]);\r\n      }\r\n    }\r\n\r\n    let a: number;\r\n    let b: number;\r\n    for (let i = 1; i < n; i++) {\r\n      a = this._aLeft[i];\r\n      vectorX[i].x -= a * vectorX[i - 1].x;\r\n      vectorX[i].y -= a * vectorX[i - 1].y;\r\n      vectorX[i].z -= a * vectorX[i - 1].z;\r\n    }\r\n\r\n    // Print (\"LU  L inverse B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    b = 1.0 / this._aDiag[n1];\r\n    vectorX[n1].x *= b;\r\n    vectorX[n1].y *= b;\r\n    vectorX[n1].z *= b;\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      a = this._aRight[i];\r\n      b = 1.0 / this._aDiag[i];\r\n      vectorX[i].x = (vectorX[i].x - a * vectorX[i + 1].x) * b;\r\n      vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;\r\n      vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Allocate a complete copy */\r\n  public copy(): TriDiagonalSystem {\r\n    const n = this._aDiag.length;\r\n    const B = new TriDiagonalSystem(n);\r\n    for (let i = 0; i < n; i++) {\r\n      B._aLeft[i] = this._aLeft[i];\r\n      B._aDiag[i] = this._aDiag[i];\r\n      B._aRight[i] = this._aRight[i];\r\n      B._x[i] = this._x[i];\r\n      B._b[i] = this._b[i];\r\n    }\r\n    B._dataState = this._dataState;\r\n    return B;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flatten(): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flattenWithPoints(xyzB: Point3d[]): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);\r\n    }\r\n    return data;\r\n  }\r\n}\r\n"]}

package/lib/esm/numerics/UnionFind.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+ * * Each of the entities being merged exists as an entry in an array.
+ * * The index in the array is the (only!) identification of the entity.
+ * * The array entry is the index of a parent in the merge process.
+ * * New entries are created as singletons pointing to themselves.
+ * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.
+ * * The merge process updates the indices "above" (i) and (j)
+ * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.
+ * @internal
+ */
+export declare class UnionFindContext {
+    private _parentArray;
+    /** Create a set initialized with numLeaf singleton subsets */
+    constructor(numLeaf?: number);
+    /** Return the number of leaves. */
+    get length(): number;
+    /** test if index is within the valid index range. */
+    isValidIndex(index: number): boolean;
+    /** Return the index of a new singleton set */
+    addLeaf(): number;
+    /**
+     * * follow links to parent
+     * * after finding the parent, repeat the search and reset parents along the way.
+     * * If index is invalid, return index unchanged.
+     * @param index start of search
+     */
+    findRoot(index: number): number;
+    /** Merge the subsets containing index (i) and (j)
+     * * Look up the root of each.
+     * * Fix up the path to the root so it points to the root.
+     * * Return the root index of the merged set.
+     * * If either index is invalid return index i with no changes.
+     */
+    mergeSubsets(i: number, j: number): number;
+    /** Return the immediate parent of index (i), with no fixups
+     * * If index is invalid, return it.
+     */
+    askParent(index: number): number;
+    /** Return the number of entries which are their own parent. */
+    countRoots(): number;
+    /** Return the number of entries whose parent is not a root. */
+    countNonTrivialPaths(): number;
+    /** Return an array of all root indices.
+     * * This array is sorted.
+     */
+    collectRootIndices(): number[];
+}
+//# sourceMappingURL=UnionFind.d.ts.map

package/lib/esm/numerics/UnionFind.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnionFind.d.ts","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,YAAY,CAAW;IAC/B,8DAA8D;gBAC3C,OAAO,GAAE,MAAU;IAKtC,mCAAmC;IACnC,IAAW,MAAM,IAAI,MAAM,CAAqC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAG3C,8CAA8C;IACvC,OAAO,IAAI,MAAM;IAKxB;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAoBtC;;;;;OAKG;IACI,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAUjD;;OAEG;IACI,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAKvC,+DAA+D;IACxD,UAAU,IAAI,MAAM;IAQ3B,+DAA+D;IACxD,oBAAoB,IAAI,MAAM;IAUrC;;OAEG;IACI,kBAAkB,IAAI,MAAM,EAAE;CAStC"}

package/lib/esm/numerics/UnionFind.js

@@ -0,0 +1,117 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/**
+ * Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+ * * Each of the entities being merged exists as an entry in an array.
+ * * The index in the array is the (only!) identification of the entity.
+ * * The array entry is the index of a parent in the merge process.
+ * * New entries are created as singletons pointing to themselves.
+ * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.
+ * * The merge process updates the indices "above" (i) and (j)
+ * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.
+ * @internal
+ */
+export class UnionFindContext {
+    /** Create a set initialized with numLeaf singleton subsets */
+    constructor(numLeaf = 0) {
+        this._parentArray = [];
+        for (let i = 0; i < numLeaf; i++)
+            this._parentArray.push(i);
+    }
+    /** Return the number of leaves. */
+    get length() { return this._parentArray.length; }
+    /** test if index is within the valid index range. */
+    isValidIndex(index) {
+        return 0 <= index && index < this._parentArray.length;
+    }
+    /** Return the index of a new singleton set */
+    addLeaf() {
+        const index = this._parentArray.length;
+        this._parentArray.push(index);
+        return index;
+    }
+    /**
+     * * follow links to parent
+     * * after finding the parent, repeat the search and reset parents along the way.
+     * * If index is invalid, return index unchanged.
+     * @param index start of search
+     */
+    findRoot(index) {
+        if (!this.isValidIndex(index))
+            return index;
+        let currentIndex = index;
+        let nextIndex = this._parentArray[index];
+        while (nextIndex !== currentIndex) {
+            currentIndex = nextIndex;
+            nextIndex = this._parentArray[currentIndex];
+        }
+        const rootIndex = currentIndex;
+        // sweep up again and shorten the paths.
+        currentIndex = index;
+        while (currentIndex !== rootIndex) {
+            nextIndex = this._parentArray[currentIndex];
+            this._parentArray[currentIndex] = rootIndex;
+            currentIndex = nextIndex;
+        }
+        return rootIndex;
+    }
+    /** Merge the subsets containing index (i) and (j)
+     * * Look up the root of each.
+     * * Fix up the path to the root so it points to the root.
+     * * Return the root index of the merged set.
+     * * If either index is invalid return index i with no changes.
+     */
+    mergeSubsets(i, j) {
+        if (!this.isValidIndex(i) || !this.isValidIndex(j))
+            return i;
+        const rootIndexI = this.findRoot(i);
+        const rootIndexJ = this.findRoot(j);
+        if (rootIndexI !== rootIndexJ)
+            this._parentArray[rootIndexI] = rootIndexJ;
+        // cleanup a little more ...
+        return this.findRoot(i);
+    }
+    /** Return the immediate parent of index (i), with no fixups
+     * * If index is invalid, return it.
+     */
+    askParent(index) {
+        if (!this.isValidIndex(index))
+            return index;
+        return this._parentArray[index];
+    }
+    /** Return the number of entries which are their own parent. */
+    countRoots() {
+        let numRoot = 0;
+        const numLeaf = this._parentArray.length;
+        for (let i = 0; i < numLeaf; i++)
+            if (this._parentArray[i] === i)
+                numRoot++;
+        return numRoot;
+    }
+    /** Return the number of entries whose parent is not a root. */
+    countNonTrivialPaths() {
+        let numLong = 0;
+        const numLeaf = this._parentArray.length;
+        for (let i = 0; i < numLeaf; i++) {
+            const j = this._parentArray[i];
+            if (j !== i && this._parentArray[j] !== j)
+                numLong++;
+        }
+        return numLong;
+    }
+    /** Return an array of all root indices.
+     * * This array is sorted.
+     */
+    collectRootIndices() {
+        const roots = [];
+        const numLeaf = this._parentArray.length;
+        for (let i = 0; i < numLeaf; i++) {
+            if (this._parentArray[i] === i)
+                roots.push(i);
+        }
+        return roots;
+    }
+}
+//# sourceMappingURL=UnionFind.js.map

package/lib/esm/numerics/UnionFind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnionFind.js","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;;;;;;;;;GAUG;AACH,MAAM,OAAO,gBAAgB;IAE3B,8DAA8D;IAC9D,YAAmB,UAAkB,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,mCAAmC;IACnC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAa;QAC/B,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACxD,CAAC;IACD,8CAA8C;IACvC,OAAO;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,SAAS,KAAK,YAAY,EAAE;YACjC,YAAY,GAAG,SAAS,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;SAC7C;QACD,MAAM,SAAS,GAAG,YAAY,CAAC;QAC/B,wCAAwC;QACxC,YAAY,GAAG,KAAK,CAAC;QACrB,OAAO,YAAY,KAAK,SAAS,EAAE;YACjC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YAC5C,YAAY,GAAG,SAAS,CAAC;SAC1B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU,KAAK,UAAU;YAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;QAC7C,4BAA4B;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD,+DAA+D;IACxD,UAAU;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,OAAO,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+DAA+D;IACxD,oBAAoB;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,kBAAkB;QACvB,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACjB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/**\r\n * Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure\r\n * * Each of the entities being merged exists as an entry in an array.\r\n * * The index in the array is the (only!) identification of the entity.\r\n * * The array entry is the index of a parent in the merge process.\r\n * * New entries are created as singletons pointing to themselves.\r\n * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.\r\n * * The merge process updates the indices \"above\" (i) and (j)\r\n * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.\r\n * @internal\r\n */\r\nexport class UnionFindContext {\r\n  private _parentArray: number[];\r\n  /** Create a set initialized with numLeaf singleton subsets */\r\n  public constructor(numLeaf: number = 0) {\r\n    this._parentArray = [];\r\n    for (let i = 0; i < numLeaf; i++)\r\n      this._parentArray.push(i);\r\n  }\r\n  /** Return the number of leaves. */\r\n  public get length(): number { return this._parentArray.length; }\r\n  /** test if index is within the valid index range. */\r\n  public isValidIndex(index: number): boolean {\r\n    return 0 <= index && index < this._parentArray.length;\r\n  }\r\n  /** Return the index of a new singleton set */\r\n  public addLeaf(): number {\r\n    const index = this._parentArray.length;\r\n    this._parentArray.push(index);\r\n    return index;\r\n  }\r\n  /**\r\n   * * follow links to parent\r\n   * * after finding the parent, repeat the search and reset parents along the way.\r\n   * * If index is invalid, return index unchanged.\r\n   * @param index start of search\r\n   */\r\n  public findRoot(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    let currentIndex = index;\r\n    let nextIndex = this._parentArray[index];\r\n    while (nextIndex !== currentIndex) {\r\n      currentIndex = nextIndex;\r\n      nextIndex = this._parentArray[currentIndex];\r\n    }\r\n    const rootIndex = currentIndex;\r\n    // sweep up again and shorten the paths.\r\n    currentIndex = index;\r\n    while (currentIndex !== rootIndex) {\r\n      nextIndex = this._parentArray[currentIndex];\r\n      this._parentArray[currentIndex] = rootIndex;\r\n      currentIndex = nextIndex;\r\n    }\r\n    return rootIndex;\r\n  }\r\n\r\n  /** Merge the subsets containing index (i) and (j)\r\n   * * Look up the root of each.\r\n   * * Fix up the path to the root so it points to the root.\r\n   * * Return the root index of the merged set.\r\n   * * If either index is invalid return index i with no changes.\r\n   */\r\n  public mergeSubsets(i: number, j: number): number {\r\n    if (!this.isValidIndex(i) || !this.isValidIndex(j))\r\n      return i;\r\n    const rootIndexI = this.findRoot(i);\r\n    const rootIndexJ = this.findRoot(j);\r\n    if (rootIndexI !== rootIndexJ)\r\n      this._parentArray[rootIndexI] = rootIndexJ;\r\n    // cleanup a little more ...\r\n    return this.findRoot(i);\r\n  }\r\n  /** Return the immediate parent of index (i), with no fixups\r\n   * * If index is invalid, return it.\r\n   */\r\n  public askParent(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    return this._parentArray[index];\r\n  }\r\n  /** Return the number of entries which are their own parent. */\r\n  public countRoots(): number {\r\n    let numRoot = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++)\r\n      if (this._parentArray[i] === i)\r\n        numRoot++;\r\n    return numRoot;\r\n  }\r\n  /** Return the number of entries whose parent is not a root. */\r\n  public countNonTrivialPaths(): number {\r\n    let numLong = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      const j = this._parentArray[i];\r\n      if (j !== i && this._parentArray[j] !== j)\r\n        numLong++;\r\n    }\r\n    return numLong;\r\n  }\r\n  /** Return an array of all root indices.\r\n   * * This array is sorted.\r\n   */\r\n  public collectRootIndices(): number[] {\r\n    const roots = [];\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      if (this._parentArray[i] === i)\r\n        roots.push(i);\r\n    }\r\n    return roots;\r\n  }\r\n}\r\n"]}

package/lib/esm/numerics/UsageSums.d.ts

@@ -0,0 +1,86 @@
+import { Range1d } from "../geometry3d/Range";
+/**
+ * Accumulator for computing average and standard deviations.
+ * * Usual usage pattern:
+ *   * create with `sums = new UsageSums ()`
+ *   * announce data values with any combination of
+ *      * `sums.accumulate (x: number)`
+ *      * `sums.accumulateArray (data: numberArray)`
+ *   * query properties at any time:
+ *      * `sums.mean`
+ *      * `sums.count`
+ *      * `sums.meanSquare`
+ *      * `sums.standardDeviation`
+ *      * `sums.minMax`
+ * * Optional `origin`
+ *   * if `origin` is nonzero:
+ *      * when a value `x` is announced to the `accumulate(x)` method, the value used for sums is `(x-origin)`
+ *   * All queries (mean, minMax, meanSquare, standardDeviation) return values relative to the origin.
+ *   * The origin can be reset in two different ways:
+ *     * `setOrigin(a)` sets the saved origin value to `a`, but leaves sums unchanged.
+ *       * This affects subsequence how sums are changed by `announce(x)`
+ *     * `shiftOriginAndSums` sets the origin (like `sums.setOrigin (a))` and also corrects all sums and minMax so they appear that the new origin had been in effect during all prior `accumulate(x)` calls.
+ * @internal
+ */
+export declare class UsageSums {
+    /** number of values accumulated. */
+    private _count;
+    /** Sum of values sent to `accumulate` (with origin subtracted away) */
+    private _sumX;
+    private _sumXX;
+    private _minMax;
+    /** working origin.
+     * * All other values -- sum0, sum1, sum2, min,max -- are "from this origin"
+     */
+    private _origin;
+    /** Constructor:
+     * * All sums 0
+     * * min and max set to extreme values.
+     * * origin assigned.
+     */
+    constructor(origin?: number);
+    /** Return the number of samples seen */
+    get count(): number;
+    /** return the mean of all samples.
+     * * Return 0 if no samples
+     */
+    get mean(): number;
+    /** Return the mean of  squared samples.
+     * * Return 0 if no samples.
+     */
+    get meanSquare(): number;
+    get minMax(): Range1d;
+    /**
+     * Return the "biased standard deviation" (https://en.wikipedia.org/wiki/Standard_deviation)
+     * * This is zero if count is zero.
+     */
+    get standardDeviation(): number;
+    /** Reinitialize all sums.
+     * * origin is unchanged
+     */
+    clearSums(): void;
+    /**
+     * return the origin being used in the `accumulate(x)` method.
+     */
+    get origin(): number;
+    /**
+     * Reset the origin.
+     * * Former sums are unchanged !!
+     * @param origin new origin
+     */
+    setOrigin(origin: number): void;
+    /**
+     * * reset the origin
+     * * adjust all sums to what they would be if the new origin had been in effect.
+     */
+    shiftOriginAndSums(origin: number): void;
+    /** Accumulate a single value */
+    accumulate(x: number): void;
+    /** Accumulate a single value */
+    accumulateArray(xArray: number[]): void;
+    /** Clone all content (origin, count, sums, minMax) */
+    clone(result?: UsageSums): UsageSums;
+    /** Compare all content. */
+    isAlmostEqual(other: UsageSums): boolean;
+}
+//# sourceMappingURL=UsageSums.d.ts.map

package/lib/esm/numerics/UsageSums.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UsageSums.d.ts","sourceRoot":"","sources":["../../../src/numerics/UsageSums.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,qBAAa,SAAS;IACpB,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAS;IACvB,uEAAuE;IACvE,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,OAAO,CAAU;IACzB;;OAEG;IACH,OAAO,CAAC,OAAO,CAAS;IAExB;;;;OAIG;gBACgB,MAAM,GAAE,MAAU;IAKrC,wCAAwC;IACxC,IAAW,KAAK,IAAI,MAAM,CAAwB;IAClD;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,CAA6D;IACtF;;OAEG;IACH,IAAW,UAAU,IAAI,MAAM,CAA8D;IAC7F,IAAW,MAAM,IAAI,OAAO,CAAiC;IAE7D;;;OAGG;IACH,IAAW,iBAAiB,IAAI,MAAM,CAOrC;IACD;;OAEG;IACI,SAAS;IAIhB;;OAEG;IACH,IAAW,MAAM,IAAI,MAAM,CAAyB;IACpD;;;;OAIG;IACI,SAAS,CAAC,MAAM,EAAE,MAAM;IAG/B;;;OAGG;IACI,kBAAkB,CAAC,MAAM,EAAE,MAAM;IAQxC,gCAAgC;IACzB,UAAU,CAAC,CAAC,EAAE,MAAM;IAO3B,gCAAgC;IACzB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE;IAIvC,sDAAsD;IAC/C,KAAK,CAAC,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS;IAU3C,2BAA2B;IACpB,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;CAOhD"}